一.分支结构
1.if分支
if(条件语句){ 语句块}
else if{}
else{}
注意点:
//else和他离得最近的未匹配的if进行匹配
int main() {
int age = 89;
if (age < 18)
printf("未成年");
else if (age >= 18 && age < 35) //双重条件要用到逻辑操作符
printf("青年");
else
printf("年纪大");
return 0;
}
2.switch分支
注意点:case运行结束的标志是break语句的出现,否则它会继续往下走
int main() {
int day = 0;
scanf_s("%d", &day);
switch (day) {
case 1:
printf("星期一");
break;
case 2:
printf("星期二");
break;
case 3:
printf("星期三");
break;
case 4:
printf("星期四");
break;
case 5:
printf("星期五");
break;
default: //每个switch语句中只能出现一条default子句,就是没有出现1,2,3,4,5时的情况处理方法
printf("输入错误");
break;
}return 0;
}
二.循环结构
1.while循环
while(条件句){语句块};
int main() {
int i = 1;
while (i <= 10) {
if (i == 5)
continue; //continue有机会执行时,终止本次循环,开始下一次循环,所以它会打印出1 2 3 4,之后陷入死循环
printf("%d ", i);
i++;
}
return 0;
}
//int main() {
char ch = getchar(); //该函数类似于输入函数scanf
putchar(ch); //打印输入的字符,替代了printf
return 0;
}
int main() {
char a = {'0'};
char ch = { '0' };
char s[20] = { 0 };
printf("请输入密码:");
scanf("%s", s);
while ( ch = getchar() != '\n') {
;
}
getchar(); //作用是把回车键产生的'\n'给读取过去,防止被下面的getchar读取,造成失败
printf("请确认(Y/N):>");
a = getchar();
if (a == 'Y')
printf("确认成功");
else
printf("失败");return 0;
}
//int main() {
int ch = 0;
while ((ch=getchar())!=EOF) {
if (ch < '0' || ch>'9')
continue;
putchar(ch);
}
return 0;
}
2.for循环
for(初始语句;判断语句;调整语句){}
//for循环的初始化,判断,调整都可以省略。判断条件省略时,其条件就恒为真
int main() {
int i = 0;
int k = 0;
for (i = 0, k = 0; k = 0; i++, k++) //判断语句k=0(赋了个值),表示恒为假,压根进不去循环体
k++;
return 0;
} //所以本代码运行无结果
计算n的阶乘
int main() {
int n = 0;
int i = 0;
int m = 1;
//int sum = 0; (不必要)
scanf("%d", &n);
for (i = 1; i <= n; i++) {
m = m * i;
//sum += m;(不必要,求和)
}
printf("%d\n", sum);printf("%d\n",m)
return 0;}
//计算1到10的阶乘的和
int main() {
int n, i;
int s = 0;
int m = 1;
for (n = 1; n <= 10; n++) {
m = 1; //非常重要,没有它就会发生累积的情况
for (i = 1; i <= n; i++) {
m = m * i;
}
s = s + m;
}
printf("%d", s);
return 0;
}
3.do-while循环
do{循环体} while(条件) //不管怎么样循环体至少运行一次
三.经典例题
1.有序数组二分查找
int main() {
int arr[] = { 1,2,3,4,5,6,7,8,9 };
int k = 7;
int sz = sizeof(arr) / sizeof(arr[0]);
int left = 0; //左下标
int right = sz - 1; //右下标
while (left<=right) {
int mid = (left + right) / 2;
if (arr[mid] > k) {
right = mid - 1;
}
else if (arr[mid] < k) {
left = mid + 1;
}
else {
printf("找到了,下标为:%d\n",mid );
break;
}
}
if (left > right)
printf("找不到\n");
return 0;
}
2.两头分别覆盖
int main() {
char m[] = { "you are a student" };
char n[] = { "#################" };
int left = 0;
int right = strlen(m) - 1;
//int right=sizeof(m)/sizeof(m[0])-1-1(因为其实字符数组m最后有个没有显示的'0',它也会被代入计算)
while (left <= right) {
n[left] = m[left];
n[right] = m[right];
printf("%s\n", n);
left++;
right--;
}
return 0;
}
3.模拟用户登入,只能输入三次
int main() {
int i = 0;
char pwd[20] = {0};
for (i = 0; i < 3; i++) {
printf("请输入密码:");
scanf("%s", pwd);
if (strcmp(pwd, "123456") == 0) //不能用==判断两个字符串是否相等,用strcmp函数
{
printf("登入成功\n");
break;
}
else {
printf("输入错误\n");
}
}
if (i == 3)
printf("三次都错,强制退出\n");
return 0;
}
4.判断三个数的大小
int main() {
int a, b, c;
int m = 0;
scanf("%d%d%d",&a,&b,&c);
if (a < b) {
m = a;
a = b;
b = m;
}
if (a < c) {
m = a;
a = c;
c = m;
}
if (b < c) {
m = b;
b = c;
c = m;
}
printf("%d %d %d\n", a, b, c);
return 0;
}
5.求两个数的最大公约数(辗转相除)
int main() {
int m = 0;
int n = 0;
int r = 0;
int b = 0;
scanf("%d%d", &m, &n);
if (m < n) {
b = m;
m = n;
n = b;
}
while (m % n!=0) {
r = m % n;
m = n;
n = r;
}
printf("%d\n",n);return 0;
}
6.计算闰年
int main() {
int i = 0;
int count = 0;
for (i = 1000; i <= 2000; i++) {
//if(((i%4==0)&&(i%100!=0))||(i%400==0)) 更为简便
if (i % 4 == 0 && i % 100 != 0) {
printf("%d ", i);
count++;
}
if (i % 400 == 0) {
printf("%d ",i);
count++;
}
}
printf("count=%d\n", count);
return 0;
}
7.(1)打印素数(试除法)(打印100到200的素数)
int main() {
int i = 0;
int j = 0;
for (i = 100; i < 201; i++) {
for (j = 2; j < i; j++) {
if (i % j == 0) {
break;
}
} //两种情况跳出这个for循环,第一个就是 不是素数直接break出来,第二个就是2到i-1这些数都被验证无法被整除,所以j++后i=j,途经判断语句不成立,跳出for循环
if (i == j) {
printf("%d ", i);
}}
return 0;
}
7.(2)让计算机判断次数变少的方法
//一个不是素数的数肯定可以写成a*b的形式,a或者b至少有一个<=开平方i
int main() {
int i = 0;
int j = 0;
for (i = 100; i <=200; i++) {
for (j = 2; j <= sqrt(i); j++) {
if (i % j == 0) {
break;
}
}
if (j>sqrt(i)) {
printf("%d ", i);
}
}
return 0;
}
8.求1/1-1/2+1/3+.....-1/100的和
int main() {
int i = 0;
double sum = 0;
int f = 1;
for (i = 1; i <= 100; i++) {
sum += f*1.0 / i; //不能化成1/i,化成1/i时当i取大于1的数时得到的都为0
f = -f;
}
printf("sum=%lf ", sum);
return 0;
}
9.判断十个整数中最大的
int main() {
int i = 0;
int arr[] = { -1,-2,-3,-4,-5,-6,-7,-8,-9,-10 };
int max = arr[0]; //如果就初始化为0的话只适用于全为正整数的情况
int sz = sizeof(arr) / sizeof(arr[0]);
for (i = 1; i < 10; i++) {
if (arr[i] > max)
max = arr[i];
}
printf("max=%d ",max);
return 0;
}
10.99乘法表
int main() {
int i = 0;
int j = 0;
for (i = 1; i <= 9; i++) {
for (j = 1; j <= i; j++) {
printf("%d*%d=%-2d ", i, j, i * j); //第三个数给打印两位,多的空格补齐,-2表示向左对齐
}
printf("\n"); //弄完开辟新的一行
}
return 0;
}