代码搜索:Switch

找到约 10,000 项符合「Switch」的源代码

代码结果 10,000
www.eeworm.com/read/196362/8097193

java menu.java

class Menu{ public static void main(String[] args) throws java.io.IOException{ char choice; do{ System.out.println("Help on"); System.out.println("1. if"); System.out.pri
www.eeworm.com/read/396264/8117716

txt ad转换数字变16进制.txt

uchar ge,shi,bai; void display(uchar shu) //动态显示十进制数 { uchar a,b,c; a=shu/100; b=shu%100/10; c=shu%10; welage=0; P0=table[c]; delay(10); welage=1; welashi=0;
www.eeworm.com/read/295928/8134611

cpp algo3-3.cpp

// algo3-3.cpp 括号匹配的检验,(限于()、[]) typedef char SElemType; #include"c1.h" #include"c3-1.h" #include"bo3-1.cpp" void check() { // 对于输入的任意一个字符串,检验括号是否配对 SqStack s; SElemType ch[80],
www.eeworm.com/read/295928/8134644

cpp algo3-7.cpp

// algo3-7.cpp 表达式求值(范围为int类型,输入负数要用(0-正数)表示) typedef int SElemType; // 栈元素类型为整型,改进算法3.4 #include"c1.h" #include"c3-1.h" #include"bo3-1.cpp" SElemType Precede(SElemType t1,SElemType t2) /
www.eeworm.com/read/295928/8134685

cpp algo3-6.cpp

// algo3-6.cpp 表达式求值(输入、输出和中间结果均只能是0~9) typedef char SElemType; #include"c1.h" #include"c3-1.h" #include"bo3-1.cpp" SElemType Precede(SElemType t1,SElemType t2) { // 根据教科书表3.1,判断两符号的优先关
www.eeworm.com/read/195683/8135745

c al4_5.c

/*案例代码文件名:AL4_5.C。*/ main() { int score, grade; printf("Input a score(0~100): "); scanf("%d", &score); grade = score/10; /*将成绩整除10,转化成switch语句中的case标号*/ switch (grade) { case 10
www.eeworm.com/read/195683/8135782

c al9_13.c

/*案例代码文件名:AL9_13.C*/ /*程序功能:带参主函数的应用示例*/ main(int argc,char *argv[]) { char c; if (argc != 3) printf("参数个数不对!\n"); else { c=*argv[1]; /*截取第二个实参字符串的第一个字符*/ switc
www.eeworm.com/read/295784/8141516

c wjg.c

#include "d1.c" #include "d2.c" #include "d3.c" #include "d4.c" int m() { int i; clrscr(); printf("\t|*******************|\n"); printf("\t| Chose One |\n"); printf("
www.eeworm.com/read/395965/8141672

cpp welcome.cpp

#include"traffic.h" void Welcome() { char c; ALGraph G; Inite(G); openfile("welcome"); switch(c) { case 's':case 's': Scan(G);break; case 'e':case 'E': Edit(G);break; cas