笔记
2021.7.10
输入长宽计算面积
#include <stdio.h> //头文件int main() //开始函数{ int length,width,area; //变量类型与格式输出控制符应保持一致// printf("please input length : ");// scanf("%d",&length);// printf("please input width : ");// scanf("%d",&width);
printf("please input length and width (以空格、tab或回车间隔): "); scanf("%d%d",&length,&width);
// width=2*length; area=length*width; printf("\nLength = %d\n",length); printf("Width = %d\n",width); printf("Area = %d\n",area); return 0; //结束语句}控制符类型
%d——整形
%f——浮点型
键盘输入语句 scanf(“控制符类型”,&变量);
输出语句 printf
浮点类型数点不可省,0可省
例:100.0 可写为 100. 不可写为 100,100为整形
算术符
例:取12345的各个位上的数字
#include <stdio.h>#include <math.h>
int main(){ float a,b,c; printf("请输入直角的两条边:"); scanf("%f%f",&a,&b); c=sqrt(a*a+b*b) ; //sqrt求平方根,需导入 #include <math.h> printf("斜边的长度为%f",c); return 0;}提取各个位上的数字
#include <stdio.h>
int main(){ int div = 12345; printf("div=%d\n",div); printf("它个位上的数为%d\n",div%10); printf("它十位上的数为%d\n",div/10%10); printf("它百位上的数为%d\n",div/100%10); printf("它千位上的数为%d\n",div/1000%10); printf("它万位上的数为%d\n",div/10000%10); return 0;}从身份证号中提取出生信息
#include <stdio.h>
int main(){ int i,j,k; printf("请输入你的身份证号:"); scanf("%*6d%4d%2d%2d%*4d",&i,&j,&k); printf("你的出生日期为:%d年%d月%d日",i,j,k); return 0;}判断是否为回文数
#include <stdio.h>#include <math.h>
int main(){ int asa,q,w,e,r,t; int len =1; printf("请输入一个5位数,回车判断是否为回文数:"); scanf("%5d",&asa); q=asa%10; w=asa/10%10; e=asa/100%10; r=asa/1000%10; t=asa/10000%10; if(q==t&&w==r){ printf("%d是回文数",asa); }else{ printf("%d不是回文数",asa); } while(asa/=10)++len; printf(",长度为%d\n",len);}计数天数
#include <stdio.h>
int main(){ int year,month,day; int total =0; printf("请输入当前年:"); scanf("%d",&year); printf("月:"); scanf("%d",&month); printf("日:"); scanf("%d",&day); switch(month) { case 12:total+=30; case 11:total+=31; case 10:total+=30; case 9:total+=31; case 8:total+=31; case 7:total+=30; case 6:total+=31; case 5:total+=30; case 4:total+=31; case 3:if((year%4==0&&year%100!=0)||(year%400==0)) total+=29; else total+=28; case 2:total+=31; case 1:total+=day; } printf("当前是%d年的第%d天",year,total);}计算出100~999之间所有个位数与百位数
#include <stdio.h>
int main(){ int i;//计算出100~999之间所有个位数与百位数 相加为9的数 for(i=100;i<=999;i++) { if((i%10)+(i/100%10)==9) printf("%d\t",i); } return 0;}改进——每行输出8个数字
#include <stdio.h>
int main(){ int i; int count=0;//计算出100~999之间所有个位数与百位数 相加为9的数 for(i=100;i<=999;i++) { if((i%10)+(i/100%10)==9) { printf("%d\t",i); count++; if(count%8==0) printf("\n"); } } return 0;}C模板
#include <stdio.h>
int main(){ printf(""); return 0;}国王收麦问题
#include <stdio.h>
int main(){ int i;//第i个格子 double sum,total;//使用double类型,避免数据溢出 sum=1;//第i个格子所拥有的小麦数 total=0;//前i个格子所拥有的小麦数总和 for(i=1;i<=64;i++) { sum*=2; total+=sum; printf("i=%d\t sum=%.0f\t total=%.0f\n",i,sum,total); //%m.nf 指定数据宽度和小数位数 } return 0;}判断是否为素数
#include <stdio.h>
int main(){ int m,i,falg=1; printf("请任意输入一个整数:"); scanf("%d",&m); for(i=2;i<=m-1;i++) { if(m%i==0) { falg=0; break; } } if(falg==1) printf("%d是一个素数\n",m); else printf("%d不是一个素数\n",m); return 0;}以*输出组成图案
#include <stdio.h>//左对齐三角//int main()//{// int i,j;// for(i=1;i<=10;i++) {// for(j=1;j<=i;j++){// putchar('*');// }// putchar('\n');// }// return 0;//}
//右对齐三角int main(){ int i,j; for(i=1;i<=10;i++) { for(j=1;j<=10-i;j++){ putchar(' ');//没有空格会报错 } for(j=1;j<=i;j++){ putchar('*'); } putchar('\n'); } return 0;}统计字符
#include <stdio.h>
int main(){ int num=0; char cl; printf("请输入一段字符(以点.结束):"); cl=getchar(); while(cl!='.') { num=num+1; cl=getchar(); } printf("有字符%d个",num); return 0;}递归函数
#include <stdio.h>
int mian(){
return 0;}long fact(int n){ if(n==0) return 1L; return n*fact(n-1);}数组
#include <stdio.h>
int main(){ int i,a[5]; printf("请输入数组的5个数:"); for(i=0;i<5;i++) scanf("%d",&a[i]); for(i=4;i>=0;i--) printf("a[%d]=%d\n",i,a[i]);// printf("\n"); return 0;}Fibonacci数列
#include <stdio.h>int main(){ int i,f[21]; f[1]=1; f[2]=2; for(i=3;i<=20;i++) f[i]=f[i-1]+f[i-2]; for(i=1;i<=20;i++) { printf("%d\t",f[i]); if(i%5==0) printf("\n"); } return 0;}冒泡排序法
#include <stdio.h>int main(){ int i,j,a[10]; printf("请输入10个整数:"); for(i=0;i<=9;i++) scanf("%d",&a[i]); for(i=1;i<=9;i++) { for(j=0;j<=9-i;j++) { if(a[j]>a[j+1]) { int t; t=a[j]; a[j]=a[j+1]; a[j+1]=t; } } } for(i=0;i<=9;i++) printf("%d\t",a[i]); return 0;}改进
#include <stdio.h>int main(){ int i,j,a[10],flag; printf("请输入10个整数:"); for(i=0;i<=9;i++) scanf("%d",&a[i]); for(i=1,flag=0;i<=9;i++,flag=0) { for(j=0;j<=9-i;j++) { if(a[j]>a[j+1]) { int t; t=a[j]; a[j]=a[j+1]; a[j+1]=t; flag=1;//发生了交换,将flag赋值为1,表示发生了交换。 } } if(flag==0)//如果这一轮flag都未被赋值为1,即未发生交换,代表已排序好,提前跳出 整个 循环。 break; } for(i=0;i<=9;i++) printf("%d\t",a[i]); return 0;}字符输出
#include <stdio.h>int main(){ char str[]="china"; int i; for(i=0;str[i]!='\0';i++) { putchar(str[i]); printf("\t"); } return 0;}字符输入与输出
#include <stdio.h>int main(){// char str[]="china";// int i;// for(i=0;str[i]!='\0';i++)// {// putchar(str[i]);// printf("\t");// } char str[40]; gets(str); puts(str); return 0;}统计单词个数
#include <stdio.h>int main(){ char str[255]; int i,num=0; gets(str); if(str[0]!=' ') num=1; for(i=0;str[i];i++) { if(str[i]==' '&&str[i+1]!=' ') num++; } printf("您输入了%d个单词",num); return 0;}指针
#include <stdio.h>int main(){ int a=100,b=10; int *pointer1,*pointer2; pointer1=&a; pointer2=&b; printf("a=%d,b=%d\n",a,b); printf("*pointer1=%d,*pointer2=%d\n",*pointer1,*pointer2); return 0;}交换变量
#include <stdio.h>void swap(int *p1,int *p2){ int temp; temp=*p1; *p1=*p2; *p2=temp;}int main(){ int a,b; printf("请输入两个整数a和b:"); scanf("%d%d",&a,&b); printf("a=%d,b=%d\n",a,b); swap(&a,&b); printf("交换后:a=%d,b=%d",a,b); return 0;}题目如上
#include <stdio.h>int main(){ int i, j, a[3][3]; for (i = 0; i < 3; i++) { /* code */ for (j = 0; j < 3; j++) { /* code */ printf("a[%d][%d]=", i, j); scanf("%d", &a[i][j]); } } for (i = 0; i < 3; i++) { /* code */ for (j = 0; j < 3; j++) { if (i == 1 || j == 1) { /* code */ printf("%-6d",a[i][j]); }else{ printf("%-6c",' '); } } printf("\n"); } return 0;}二分法查找
思考:怎么判断输入的是否为数字还是字符、符号等;是数字话判断是否为整数.
ASClL码
#define M 10 //将所有M赋值为10,M不改变#include <stdio.h>
void main(){ int low,mid,high,n,found; int a[M]={-2,3,12,43,67,82,99,101,108,999};//数组一定是有序的!!! low=0; high=M-1; found=0;//默认为0,找到值将赋值为1 printf("请输入一个整数n:"); in:scanf("%d",&n); //如果输入值超出范围,跳转到输入语句重新输入,不进行循环判断,提高效率. if(n>a[high]||n<a[low]){ printf("非法输入,请重新输入:"); goto in; } for (;low<=high;) { /* code */ mid=(low+high)/2; if (n==a[mid]) { /* code */ found=1; break; }else if(n>a[mid]){ low=mid+1; }else if(n<a[mid]){ high=mid-1; } } if (found==1) { /* code */ printf("在数组中找到了整数n,n为a[%d]=%d",mid,a[mid]); }else{ printf("未找到整数n:%d!",n); }}关于实参求值顺序测试
#include <stdio.h>
int main(){ int func(int x,int y); int p,a=2; p=func(a,++a); if(p==1){ printf("实际参数求值为自左向右"); }else if (p==0) { /* code */ printf("实际参数求值为自右向左"); }else{ printf("异常"); }}int func(int x,int y){ int c; if(x<y){ c=1; }else if(x==y){ c=0; }else{ c=-1; } return c;}求数组中最大值、最小值及平均值
#include <stdio.h>
float max=0,min=0;//全局变量void main(){ float average(float array[],int n); float ave,score[10]; for (int i = 0; i < 10; i++) { printf("请输入第%d个数:",i+1); scanf("%f",&score[i]); } ave=average(score,10); printf("MAX=%6.2f\nMIN=%6.2f\n平均值为%6.2f\n",max,min,ave);}float average(float array[],int n){ float aver,sum=array[0];//aver也可以定义为ave,为局部变量不与main函数中定义的ave冲突 max=min=array[0];//赋予初始值,循环两两比较,得出最大值与最小值 for (int i = 0; i < n; i++) { if (array[i]>max) { max=array[i]; }else if(array[i]<min) { min=array[i]; } sum+=array[i];//循环累加得出数组总和 } aver=sum/n;//总和除以数组长度,得出平均值 return aver;}利用static变量求1~10的阶乘
#include <stdio.h>int main(){ int nxc(int n); int n; for (int i = 1; i <= 10; i++) { printf("%d!==%d\n",i,nxc(i)); } return 0;}int nxc(int n){ static int f=1; f*=n; return f;}利用递归求阶乘n!
#include <stdio.h>int main(){ int fac(int n); int n; printf("请输入你想计算阶乘的数:"); scanf("%d",&n); printf("%d的阶乘为%d",n,fac(n)); return 0;}int fac(int n){ int f; if(n<0) { printf("n<0,data error!"); }else if(n==0||n==1){ f=1; }else{ f=fac(n-1)*n;//这一步!!!想明白!!! } return f;}指针判断两数大小
#include <stdio.h>int main(){ int *p1,*p2,a,b; printf("a="); scanf("%d",&a); printf("b="); scanf("%d",&b); p1=&a; p2=&b; if(a<b) { p1=&b; p2=&a; } printf("a=%d,b=%d\nMax=%d,Min=%d",a,b,*p1,*p2);//不改变a,b的值}指针排序 三个数
#include <stdio.h>int main(){ void exchange(int *q1,int *q2,int *q3); int a,b,c,*p1,*p2,*p3; printf("请输入a,b,c的值:"); scanf("%d%d%d",&a,&b,&c); p1=&a; p2=&b; p3=&c; exchange(p1,p2,p3); printf("由小到大的排序为%d,%d,%d",a,b,c); printf("%d,%d,%d",*p1,*p2,*p3);//指针指向并没有改变,改变的为a,b,c的值 return 0;}void exchange(int *q1,int *q2,int *q3)//排序{ void swap(int *j1,int *j2); if (*q1>*q2)//不可使用if……else if……else if……只执行一个语句 { /* code */ swap(q1,q2); } if (*q1>*q3) { /* code */ swap(q1,q3); } if (*q2>*q3) { /* code */ swap(q2,q3); }}void swap(int *j1,int *j2)//交换值{ int temp; temp=*j1; *j1=*j2; *j2=temp;}数组输出
1、下标法
#include <stdio.h>int main(){ int a[10]; for (int i = 0; i < 10; i++) { /* code */ printf("请输入第%d个数组元素:",i+1); scanf("%d",&a[i]); } for (int i = 0; i < 10; i++) { /* code */ printf("a[%d]=%d\n",i,a[i]); } return 0;}2、取地址法
#include <stdio.h>int main(){ int a[10]; for (int i = 0; i < 10; i++) { /* code */ printf("请输入第%d个数组元素:",i+1); scanf("%d",&a[i]); } for (int i = 0; i < 10; i++) { /* code */ printf("a[%d]=%d\n",i,*(a+i)); } return 0;}3、指针法
#include <stdio.h>int main(){ int a[10],*p; for (int i = 0; i < 10; i++) { /* code */ printf("请输入第%d个数组元素:",i+1); scanf("%d",&a[i]); } //取其一 // p=a; // for (int i = 0; i < 10; i++) // { // /* code */ // printf("a[%d]=%d\n",i,*(p+i)); // } int i=0; for (p = a; p < (a+10); p++,i++) { /* code */ printf("a{%d]地址为%d,值为%d\n",i,p,*p); } return 0;}数组倒换---数组名实参
#include <stdio.h>int main(){ void inv(int a[],int n); int a[10],*p; for (int i = 0; i < 10; i++) { /* code */ printf("请输入第%d个数组元素:",i+1); scanf("%d",&a[i]); } p=a; printf("正序:\n"); for (int i = 0; i < 10; i++) { /* code */ printf("a[%d]=%d\n",i,*(p+i)); } inv(a,10); printf("倒序:\n"); for (int i = 0; i < 10; i++) { /* code */ printf("a[%d]=%d\n",i,*(p+i)); } return 0;}void inv(int a[],int n){ int temp,i,j,m=(n-1)/2; for ( i = 0; i <= m; i++) { /* code */ j=n-1-i; temp=a[i]; a[i]=a[j]; a[j]=temp; } return;}数组倒换---指针实参
#include <stdio.h>int main(){ void exchange(int *p, int *q); int a[10], n = 10, *p; for (int i = 0; i < 10; i++) { /* code */ scanf("%d", &a[i]); } p = a; for (int i = 0; i < n / 2; i++) { exchange((p+i), (p+9-i)); } for (int i = 0; i < 10; i++) { printf("%d ", a[i]); } return 0;}void exchange(int *p, int *q) //排序{ /* code */ int temp; temp = *p; *p=*q; *q=temp;}字符转换,大写转小写
#include <stdio.h>int main(){ char A; scanf("%c",&A); printf("%c",A+32); return 0;}输入BOY三个字符,输出
#include <stdio.h>int main(){ char A,B,C; A=getchar(); B=getchar(); C=getchar(); putchar(A); putchar(B); putchar(C); return 0;}输出三数最大(if-else)
#include <stdio.h>int main(){ int a,b,c; scanf("%d%d%d",&a,&b,&c); if (a>b&&a>c) { printf("%d",a); }else if(b>a&&b>c){ printf("%d",b); }else{ printf("%d",c); } return 0;}输出三数最大(三元表达式)
#include<stdio.h> int main(){ int a,b,c; scanf("%d %d %d",&a,&b,&c); printf("%d",a>b?(a>c?a:c):(b>c?b:c)); return 0; }分范围输出
给出一百分制成绩,要求输出成绩等级’A’、’B’、’C’、’D’、’E’。90分以上为‘A’,8089为‘B’,7079为‘C’,60~69为‘D’, 60分以下为‘E’。
#include <stdio.h>int main(){ int score; scanf("%d",&score); if (score>=90) { /* code */ printf("A"); } else if (80<=score&&score<90)//不可写为80<=score<90 { /* code */ printf("B"); } else if(70<=score&&score<80) { /* code */ printf("C"); }else if (60<=score&&score<70) { /* code */ printf("D"); }else{ printf("E"); } return 0;}建议这个方法2
#include <stdio.h>int main(){ float score; char grade; scanf( "%f", &score ); switch ( (int) (score / 10) ) { case 10: case 9: grade = 'A'; break; case 8: grade = 'B'; break; case 7: grade = 'C'; break; case 6: grade = 'D'; break; default: grade = 'E'; } printf( "%c\n ", grade ); return(0);}判断数字为几位数
#include <stdio.h>
int main(){ int count=0,s,t,e=1; scanf("%d",&t); do { count++;//计数 e*=10; s=t%e; } while (s!=t); printf("%d",count); return 0;}输出整数各个位上的数字(有待改进)
输入一个不多于5位的正整数,要求: 求出它是几位数 分别输出每一位数字 按逆序输出各位数字,例如原数为321,应输出123.
实际可以输入int范围以内的数,都可以
#include <stdio.h>
int main(){ int count=0,s,t, e=1; scanf("%d",&t); printf("反序数字为:"); do { printf("%d",t/e%10); count++;//计数 e*=10; s=t%e; } while (s!=t); printf("\n"); printf("位数:%d\n",count); printf("每位数字为:"); for (int e1 = e/10; e1 > 0; e1/=10) { printf("%d",t/e1%10); } return 0;}运行结果
指针引用二维数组
#include <stdio.h>
int main(){ int a[3][4] = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23}; int(*p)[4], i, j; p = a; printf("i="); scanf("%d", &i); while (i > 2 || i < 0) { printf("i="); scanf("%d", &i); } printf("j="); scanf("%d", &j); while (j > 3 || i < 0) { printf("j="); scanf("%d", &j); } printf("a[%d][%d]=%d",i,j,*(*(p+i)+j)); return 0;}字符串引用方法
#include <stdio.h>int main(){ //1.字符数组存入字符 char string[]="I love China!"; printf("%s\n",string);//输出全部 for (int i = 0;string[i]!='\0'; i++)//循环下标输出每个字符 { printf("%c,",string[i]); } printf("\n"); for (int i = 0;*(string+i)!='\0'; i++)//循环地址输出每个字符 { printf("%c,",*(string+i)); } printf("\n"); //2.指针法存入字符 char *str ="I love China!"; printf("%s",str); return 0;}字符串的复制
1.下标法
#include <stdio.h>int main(){ char a[]="I love China!",b[20],i; for ( i = 0; a[i]!='\0'; i++) { b[i]=a[i]; } b[i]='\0'; printf("字符串a:%s\n",a); printf("字符串b:%s",b); return 0;}2.指针法
#include <stdio.h>int main(){ char a[]="I love China!",b[20],*p1,*p2,i; p1=a; p2=b; for ( i = 0;*(p1+i)!='\0'; i++) { *(p2+i)=*(p1+i); } *(p2+i)='\0'; printf("字符串a:%s\n",a); printf("字符串b:%s",b); return 0;}3.函数调用
(字符数组作形参)
#include <stdio.h>int main(){ void copy_string(char form[], char to[]); char a[] = "I love China!", b[20]; copy_string(a,b); printf("字符串a:%s\n", a); printf("字符串b:%s", b); return 0;}void copy_string(char form[], char to[]){ int i; for (i = 0; form[i] != '\0'; i++) { to[i] = form[i]; } to[i] = '\0';}3.指针作形参
#include <stdio.h>int main(){ void copy_string(char *from, char *to); char *a = "I love China!", b[20]; copy_string(a,b); printf("字符串a:%s\n", a); printf("字符串b:%s", b); return 0;}void copy_string(char *from, char *to){ for (; *from != '\0';from++,to++) { *to = *from; } *to = '\0';}1
#include <stdio.h>int main(){ void copy_string(char *from, char *to); char *a = "I love China!", b[20]; copy_string(a,b); printf("字符串a:%s\n", a); printf("字符串b:%s", b); return 0;}void copy_string(char *from, char *to){ for (; (*to=*from) != '\0';from++,to++) {} *to = '\0';}2
#include <stdio.h>int main(){ void copy_string(char *from, char *to); char *a = "I love China!", b[20]; copy_string(a,b); printf("字符串a:%s\n", a); printf("字符串b:%s", b); return 0;}void copy_string(char *from, char *to){ for (; (*to++=*from++) != '\0';) {} *to = '\0';}3
#include <stdio.h>int main(){ void copy_string(char *from, char *to); char *a = "I love China!", b[20]; copy_string(a,b); printf("字符串a:%s\n", a); printf("字符串b:%s", b); return 0;}void copy_string(char *from, char *to){ for (; *from != '\0';) { *to++=*from++; } *to = '\0';}4最简洁
#include <stdio.h>int main(){ void copy_string(char *from, char *to); char *a = "I love China!", b[20]; copy_string(a,b); printf("字符串a:%s\n", a); printf("字符串b:%s", b); return 0;}void copy_string(char *from, char *to){ for (;*to++=*from++;)//'\0'ASCLL码为0,结束循环 {
}}指针字符输入(重要***)
char *a,b[20]; a=b;//!important,使a先有确定值,再输入 scanf("%s",a); printf("%s ", a);错误方法
char *a;//a空指针未指向, scanf("%s",a); printf("%s ", a);指针字符串输出
#include <stdio.h>int main(){ char *a = "I love China!"; printf("字符串a:%s\n", a);//输出全部 I love China! printf("字符串a+7:%s", a+7);//只输出 China! printf("字符串a[7]:%c\n", a[7]);//输出 C (指针定义的字符串也可利用下标法引用) return 0;}指向函数的指针
用指针函数求两数最大
#include <stdio.h>int main(){ int max(int ,int); int (*p)(); int a,b,c; p=max; scanf("%d %d",&a,&b); c=(*p)(a,b);//*p指向max函数 printf("a=%d,b=%d,max=%d",a,b,c);}int max(int x,int y){ int max; if (x>y) { max=x; }else{ max=y; } return max;}strucmp()函数
描述
C 库函数 **int strcmp(const char str1, const char str2) 把 str1 所指向的字符串和 str2 所指向的字符串进行比较。
声明
下面是 strcmp() 函数的声明。
int strcmp(const char *str1, const char *str2)参数
- str1 — 要进行比较的第一个字符串。
- str2 — 要进行比较的第二个字符串。
返回值
该函数返回值如下:
- 如果返回值小于 0,则表示 str1 小于 str2。
- 如果返回值大于 0,则表示 str1 大于 str2。
- 如果返回值等于 0,则表示 str1 等于 str2。
测试
memcpy()函数
描述
C 库函数 **void *memcpy(void str1, const void str2, size_t n) 从存储区 str2 复制 n 个字节到存储区 str1。
声明
下面是 memcpy() 函数的声明。
void *memcpy(void *str1, const void *str2, size_t n)参数
- str1 — 指向用于存储复制内容的目标数组,类型强制转换为 void* 指针。
- str2 — 指向要复制的数据源,类型强制转换为 void* 指针。
- n — 要被复制的字节数。
返回值
该函数返回一个指向目标存储区 str1 的指针。
宏定义 #define
文件打开fopen
#include <stdio.h>#include <stdlib.h>
void main(){ FILE *p; if (!(p=fopen("D:\\专升本资料\\tiam.txt","a")))//注意双斜杠!!!! { printf("defent"); system("pause"); }else{ printf("success"); }}文件关闭fclose
文件写入
fgetc
fgetc函数调用中,文件必须是以读或读写的方式打开
fputc
#include <stdio.h>#include <stdlib.h>
void main(){ FILE *fp; char ch,filename[20]; printf("请输入文件名:"); scanf("%s",filename); if (!(fp=fopen("D:\\专升本资料\\tiam.txt","wt+")))//注意双斜杠!!!! { printf("defent"); exit(0);//终止程序 } printf("请输入内容:"); ch=getchar();//接收回车 ch=getchar(); while (ch!=EOF) { fputc(ch,fp); ch=getchar(); } fclose(fp);}两次Ctrl+Z,结束符EOF
不同算法计算1+…100
可读性高,时间复杂度为O(n)
#include <stdio.h>int main(){ int sum=0,n=100; for (int i = 1; i <= n; i++) { sum+=i; } printf("%d",sum);}代码更简洁,时间复杂度为O(1)
#include <stdio.h>int main(){ int sum,n=100; sum=n*(n+1)/2; printf("%d",sum);}…
#include <stdio.h>int main(){ int sum=0,n=10,x=0; for (int i = 1; i <= n; i++) { for (int j = 1; j <=n; j++) { x++; sum+=x; } } printf("%d",sum);}#define宏定义
#include <stdio.h>#define PI 3.1415926int main(){ int r; double s; printf("请输入半径:"); scanf("%d",&r); s=PI*r*r; printf("圆的面积为%f",s); return 0;}嵌套替换
使用已经定义过的PI去定义S
#include <stdio.h>#define PI 3.1415926#define S PI*r*rint main(){ int r; double s; printf("请输入半径:"); scanf("%d",&r); s=S; printf("圆的面积为%f",s); return 0;}#define与typedef定义数据时的区别
#include <stdio.h>#define PIN1 char*typedef char* PIN2;//含分号!!void main(){ PIN1 a,b;//相当于char *a,b; PIN2 x,y;//相当于char *x,*y; printf("#deine:%d %d\n",sizeof(a),sizeof(b)); printf("typedef:%d %d",sizeof(x),sizeof(y));}//输出//#deine:4 1//typedef:4 4应用#define实现打印0~99
嵌套
#include <stdio.h>#define A(x) x;x;x;x;x;x;x;x;x;x;int main(){ int n=0; A(A(printf("%d ",n++))); return 0;}//输出/*0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99*/比较两数大小
#include <stdio.h>#define MAX(a,b) (a>b)?a:bint main(){ int x,y,max; printf("请输入x和y:"); scanf("%d%d",&x,&y); max=MAX(x,y); printf("%d",max); return 0;}加密输出
#include <stdio.h>#define SAY(y) (y)int main(){ char say[]={89,117,74,105,110,103};//对应字母Y,u,J,i,n,g for(int i=0;say[i];i++) { say[i]=SAY(say[i]+1);//以ascll码加1后输出字符 } printf("%s",say); return 0;}//输出/*ZvKjoh*/带参宏定义
注意计算符的优先级
#include <stdio.h>#define SQ(y) (y)*(y)//注意 y*y 与 (y)*(y) 输出结果会不同int main(){ int a,sq; printf("please input a:"); scanf("%d",&a); sq=SQ(a+1); printf("%d",sq); return 0;}//输入3//输出16//y*y 输入3//输出7#include <stdio.h>#define SQ(y) (y)*(y)//注意 (y)*(y) 和 ((y)*(y)) 输出结果会不同int main(){ int a,sq; printf("please input a:"); scanf("%d",&a); sq=160/SQ(a+1); printf("%d",sq); return 0;}//输入3//输出160//((y)*(y)) 输入3//输出10体会区别 why?
#include <stdio.h>#define SQ(y) (y)*(y)int main(){ for (int i = 1; i <= 5;i++) { printf("%d ",SQ(i)); } return 0;}//输出1 4 9 16 25#include <stdio.h>#define SQ(y) (y)*(y)int main(){ for (int i = 1; i <= 5;) { printf("%d ",SQ(i++)); } return 0;}//输出2 12 30/*1*2=22*3=63*4=124*5=205*6=30*/条件编译
#if 常量表达式..... 当 常量表达式 为1时,才编译这段,否则不进行编译#else//可省....#endif#ifdef 标识符 //相当于#if define.... 如果已对 标识符 定义,编译这段#else//可省.... 否则编译这段#endif#ifndef 标识符 //相当于#if !define...如果 标识符 未被定义,编译这段#else //可省... 否则编译这段#endif结构体与共用体
结构体定义
1
#include <stdio.h>int main(){ //声明同时定义 struct student //student可省 { int num;//4 char name;//1 char sex;//1 int tel;//4 float score;//4 char hobby[20];//20 }student1,student2; printf("student结构体所占内存大小为%d字节",sizeof(student1));}2
#include <stdio.h>int main(){ //先声明 struct student //student可省 { int num;//4 char name;//1 char sex;//1 int tel;//4 float score;//4 char hobby[20];//20 }; //再定义 struct student student1,student2;}嵌套定义
#include <stdio.h>int main(){ struct date { int month; int day; int year; }; struct student { int num; char name; struct date birthday;//嵌套定义 float score; char hobby[20]; }; struct student student1,student2; student1.birthday.year=2001;//引用}结构体引用
#include <stdio.h>int main(){ struct student //student可省 { int num;//4 char *name;//存多个字符需用指针 char sex;//只能存一个字符 int tel;//4 float score;//4 char hobby[20];//20 }student1,student2; student1.name="Linda"; student1.sex='m'; printf("name:%s\nsex:%c",student1.name,student1.sex); return 0;}第一个成员地址与结构体地址相同
#include <stdio.h>int main(){ struct student //student可省 { int num;//4 char *name;//存多个字符需用指针 char sex;//只能存一个字符 int tel;//4 float score;//4 char hobby[20];//20 }student1,student2; student1.name="Linda"; student1.sex='m'; printf("address:%o\n",&student1); printf("address:%o",&student1.num); return 0;}//输出地址相同结构体定义同时赋值
#include <stdio.h>int main(){ struct student //student可省 { int num;//4 char *name;//存多个字符需用指针 char sex;//只能存一个字符 char *tel; }student1,student2={2019240475,"Linda",'m',"17623194363"}; printf("num=%d\nname=%s\nsex=%c\ntel=%s",student2.num,student2.name,student2.sex,student2.tel); return 0;}结构体数组
#include <stdio.h>#define NUM 3struct person{ char name[20]; char tel[20];};int main(){ struct person man[NUM]; for (int i = 0; i < NUM; i++) { printf("please input your name :"); gets(man[i].name); printf("please input your telephone number:"); gets(man[i].tel); } printf("name\ttel\n"); for (int i = 0; i < NUM; i++) { printf("%s\t%s\n", man[i].name, man[i].tel); } return 0;}//输入/*please input your name :lindaplease input your telephone number:120please input your name :tomplease input your telephone number:120please input your name :jaackplease input your telephone number:119*///输出/*name tellinda 120tom 120jaack 119*/结构体变量指针
#include <stdio.h>int main(){ struct boy { char *name; int tel; }boy1={"chumen",12306}; struct boy *p; p=&boy1; printf("%s\t%d\n",boy1.name,boy1.tel); printf("%s\t%d\n",(*p).name,(*p).tel); printf("%s\t%d\n",p->name,p->tel); return 0;}//输出结果相同----三种输出形式/*chumen 12306chumen 12306chumen 12306*/结构体变量作函数参数传递
#include <stdio.h>#include <string.h> //调用strcpy函数需导入struct student{ char name[20];//当改为char *name 时,strcpy(student1.name,"Linda") 可改为 student1.name="Linda",否者报错 int score[2];}student1,student2;int print(struct student);int main(){ struct student student1; strcpy(student1.name,"Linda"); //student1.name="Linda" student1.score[0]=99; student1.score[1]=87; print(student1); return 0;}int print(struct student student1){ printf("name:%s\nchinese:%d\nmath:%d",student1.name,student1.score[0],student1.score[1]); return 0;}动态存储分配
malloc函数
calloc函数
free函数
链表
定义及索引
#include <stdio.h>struct student{ int num; char *name; struct student *next;};int main(){ struct student a,b,c,*head; head=&a; a.num=111; a.name="Joy"; a.next=&b; b.num=222; b.name="Chris"; b.next=&c; c.num=333; c.name="Red"; c.next=NULL; for (;head;) { printf("%d\t%s\n",head->num,head->name);//调用地址输出 head=head->next; } return 0;}动态链表
//error#include <stdio.h>#include <stdlib.h>#define NC sizeof(struct student)struct student{ char *name; int score; struct student *next;};int N; //全局变量struct student *creat(void){ struct student *p1, *p2, *head; N = 0; p1 = p2 = (struct student *)malloc(NC); printf("please input name and score:"); scanf("%s%d", &p1->name, &p1->score); head = NULL; for (; p1->name;) { N = N + 1; if (N == 1) { head = p1; } else { p2->next = p1; } p2 = p1; p1 = (struct student *)malloc(NC); printf("please input other student's name and score:"); scanf("%s%d", &p1->name, &p1->score); } p2->next=NULL; return head;}
int main(){ struct student *pt; pt=creat(); printf("%s\t%d",pt->name,pt->score); return 0;}报错 error: ld returned 1 exit status
原因之一: 没有main函数,或者拼写错误
动态创建链表及输出(应仔细琢磨)
#include <stdio.h>#include <malloc.h>#include <stdlib.h>#define NC sizeof(struct student)struct student{ int num; int score; struct student *next;};int N;//声明struct student *creat(void); //创建链表void print(); //打印函数int main(){ struct student *stu; stu = creat(); print(stu); printf("\n\n"); system("pause"); return 0;}struct student *creat(void){ struct student *p1, *p2, *head; p1 = p2 = (struct student *)malloc(NC); //动态分配内存大小 printf("please input num :"); scanf("%d", &p1->num); printf("please input score :"); scanf("%d", &p1->score); head = NULL;//头指针初始化 N = 0;//节点个数初始化 while (p1->num)//输入 0 以结束输入 { N++; if (N == 1) { head = p1; } else { p2->next = p1; } p2 = p1; p1 = (struct student *)malloc(NC); printf("\nplease input num :"); scanf("%d", &p1->num); printf("please input score :"); scanf("%d", &p1->score); } p2->next = NULL; return head;}void print(struct student *head){ struct student *p; printf("\nThere are %d records!\n",N); p=head; if(head) { do { printf("学号为%d的同学成绩是:%d\n",p->num,p->score); p=p->next; } while (p); }}动态链表节点删除
#include <stdio.h>#include <malloc.h>#include <stdlib.h> //动态分配内存引入#define NC sizeof(struct student) //宏定义内存大小struct student //定义结构体数据类型{ int num;//学号 int score;//分数 struct student *next;//下一个结点地址};int N; //全局变量,表示链表节点数//函数声明struct student *creat(void); //创建链表void print(); //打印函数struct student *del(); //删除函数//主函数int main(){ struct student *stu,*p; int num; //定义需删除的数据的num号
stu = creat();//创建链表,返回头指针head p=stu; print(p); //打印数据 printf("Please input the num to delete:"); scanf("%d",&num); print(del(p,num));//调用del函数后,返回头指针,重新传递给print函数打印出数据 printf("\n\n"); system("pause");//就是暂停程序的执行,等待任意健继续执行,查看结果,防止一闪而过 return 0;}//创建链表struct student *creat(void){ struct student *p1, *p2, *head; p1 = p2 = (struct student *)malloc(NC); //动态分配内存大小 printf("please input num :"); scanf("%d", &p1->num); printf("please input score :"); scanf("%d", &p1->score); head = NULL;//初始化 N = 0; while (p1->num) { N++; if (N == 1) { head = p1; } else { p2->next = p1; } p2 = p1; p1 = (struct student *)malloc(NC); printf("\nplease input num :"); scanf("%d", &p1->num); printf("please input score :"); scanf("%d", &p1->score); } p2->next = NULL; return head;}//输出链表void print(struct student *head){ struct student *p; printf("\nThere are %d records!\n", N); p = head; if (head) { do { printf("学号为%d的同学成绩是:%d\n", p->num, p->score); p = p->next; } while (p);//p为NULL时停止循环 }}//删除结点struct student *del(struct student *head, int num)//形参{ struct student *p1, *p2; if (head == NULL) { printf("\nThis is a NULL chart!"); goto END;//判断链表为空,直接跳转到返回语句 } p1 = head;//不为空赋值给p1 while (p1->num != num && p1->next != NULL) { p2 = p1; p1 = p1->next; } if (num == p1->num) { if (p1 == head) { /* code */ head = p1->next; } else { p2->next = p1->next; } printf("\nDelete num:%d data success!",num); N--; } else{ printf("\nnum:%d not been found!",num); } END:return head;}链表插入
流程图
代码
#include <stdio.h>#include <malloc.h>#include <stdlib.h>#define NC sizeof(struct student)struct student{ int num; int score; struct student *next;} ;int N;struct student *creat(void); //创建链表 声明void print(); //打印函数struct student *del(); //删除函数struct student *insert(struct student *head, struct student *in_stu); //插入函数int main(){ struct student *stu, *p,in_stu; int num;
stu = creat(); p = stu; print(p);
printf("Please input the num to delete:"); scanf("%d", &num); print(del(p, num));
printf("Please input the num to insert:"); scanf("%d", &in_stu.num); printf("Please input the score:"); scanf("%d", &in_stu.score); print(insert(stu, &in_stu));
printf("\n\n"); system("pause"); return 0;}struct student *creat(void){ struct student *p1, *p2, *head; p1 = p2 = (struct student *)malloc(NC); //动态分配内存大小 printf("please input num :"); scanf("%d", &p1->num); printf("please input score :"); scanf("%d", &p1->score); head = NULL; N = 0; while (p1->num) { N++; if (N == 1) { head = p1; } else { p2->next = p1; } p2 = p1; p1 = (struct student *)malloc(NC); printf("\nplease input num :"); scanf("%d", &p1->num); printf("please input score :"); scanf("%d", &p1->score); } p2->next = NULL; return head;}void print(struct student *head){ struct student *p; printf("\nThere are %d records!\n", N); p = head; if (head) { do { printf("学号为%d的同学成绩是:%d\n", p->num, p->score); p = p->next; } while (p); }}struct student *del(struct student *head, int num){ struct student *p1, *p2; if (head == NULL) { printf("\nThis is a NULL chart!"); goto END; } p1 = head; while (p1->num != num && p1->next != NULL) { p2 = p1; p1 = p1->next; } if (num == p1->num) { if (p1 == head) { /* code */ head = p1->next; } else { p2->next = p1->next; } printf("\nDelete num:%d data success!", num); N--; } else { printf("\nnum:%d not been found!", num); }END: return head;}struct student *insert(struct student *head, struct student *in_stu){ struct student *p0, *p1, *p2; p1 = head; p0 = in_stu; if (NULL == head) //判断是否为空表 { head = p0; p0->next = NULL; } else { while ((p0->num > p1->num) && (p1->next != NULL)) { p2 = p1; p1 = p1->next; } if (p0->num <= p1->num) //判断是否在头指针插入 { if (head == p1) //插入头部 { head = p0; } else //在中间插入 { p2->next = p0; } p0->next = p1; } else //插入末位 { p1->next = p0; p0->next = NULL; } } N++;//记录节点加一 return head;}判断是否为数字或字符是否为回文
倒换字符判断与原字符是否相等
#include <stdio.h>#include <string.h>int main(){ char h[20],n[20]; int mid, d; printf("请输入:"); scanf("%s", h); strcpy(n,h);//strcpy函数,将h复制给n printf("输出n:%s\n", n); d=strlen(h); //strlen函数 直接输出数组长度,或者下面方法循环计数得出 // for (d = 0; h[d] != '\0'; d++); //计数,输入的字符长度i mid = d / 2; //倒换字符数组 if (d % 2 == 0) //长度为偶数 { for (int i = 0; i < mid; i++) { char temp; temp = h[mid + i]; h[mid + i] = h[mid - 1 - i]; h[mid - 1 - i] = temp; } } else //长度为奇数 { for (int i = 0; i <= mid; i++) { char temp; temp = h[mid + i]; h[mid + i] = h[mid - i]; h[mid - i] = temp; } } printf("输出h:%s,长度%d\n", h,d); if (strcmp(h,n)==0)//strcmp函数 比较两个字符串大小,相等则为0; { printf("%s 是回文数",n); }else{ printf("%s 不是回文数",n); } return 0;}方法二
指针方法----妙啊
#include <stdio.h>void main(){ char str[81], *p, *q; gets( str ); //输入得到 字符窜 for ( q = str; *q != '\0'; q++ );//将q指针循环指向到数组中最后一位,即指向 '\0' // q-- ,使q指针指向数组最后一个字符,而不是结束字符 '\0' //p=str 使p指针指向数组第一个字符 //当p<q,且指向的字符相等,执行循环. //当p>=q,说明循环执行完成,是回文数 for ( p = str, q--; (p < q) && (*p == *q); p++, q-- ); if ( p < q ) printf( "no" ); else printf( "yes" );}结构数组根据分数大小排序
冒泡排序法
#include <stdio.h>//声明一个名字为Student的数据类型// your code#define M 5int main(){ //your code begin struct Student { int num; char *name; float score; } stu[M] = {{10101, "Zhang", 78}, {10103, "Wang", 98.5}, {10106, "Li", 86}, {10108, "Ling", 73.5}, {10110, "Fun", 100}}; for (int j = 0; j < M; j++) { for (int i = 0; i < M - j; i++) { if (stu[i].score < stu[i + 1].score) { struct Student temp; temp=stu[i]; stu[i]=stu[i+1]; stu[i+1]=temp; } } } for (int i = 0; i < M; i++) { /* code */ printf("%d %s %.2f\n", stu[i].num, stu[i].name, stu[i].score); } //your code end return 0;}动态数组筛选
#include <stdio.h>#include <stdlib.h>#define N 5int main(){ int check(int *); int *p1; p1=(int *)malloc(N*sizeof(int)); printf("please enter:"); for (int i = 0; i < N; i++) { scanf("%d",p1+i); } check(p1); return 0;}int check(int *p){ for (int i = 0; i < N; i++) { if (*(p+i)<60) { printf("%d ",*(p+i)); }
} return 0;}加密字符串
#include <stdio.h>int main(){ int d, slen = 6; char *a = "Weihua"; printf("%s ", a); for (int i = 0; i < slen; i++) { if ((i + slen / 2) > 5) { d = (int)*(a + i) - (int)*(a + i + slen / 2 - 6); } else { d = (int)*(a + i) - (int)*(a + i + slen / 2); } for (; d < 97; d += 26) ; printf("%c", d); } return 0;}动态输入
#include <stdio.h>#include <string.h>int main(){ int d, slen; char *a,b[20]; a=b; //注意字符指针的输入方式 printf("please enter:"); scanf("%s",a); slen=strlen(a);//计算字符指针长度 printf("%s ", a); for (int i = 0; i < slen; i++) { if ((i + slen / 2) > 5) { d = (int)*(a + i) - (int)*(a + i + slen / 2 - 6); } else { d = (int)*(a + i) - (int)*(a + i + slen / 2); } for (; d < 97; d += 26) ; printf("%c", d); } return 0;}字符排序
有问题!!!不能得到结果
#include <stdio.h>#include <string.h>#define M 5int main(){ char *str[M] = {"China", "Japan", "Korea", "American", "England"}; for (int j = 0; j < M; j++) { for (int i = 0; i < M - j - 1; i++) { if (strcmp(str[i], str[i + 1]) > 0) { char *temp; temp = str[i]; str[i] = str[i + 1]; str[i + 1] = temp; } } printf("%s ", str[j]); } return 0;}问题在这里
不能再内部循环中输出, 为啥????
因为 在j=0的时候,内循环完成排序为 C J A E K ,并未完全排序完成,就已经执行了打印语句,输出了str[0] ,即”China”,余下相同原因.
后面另外加输出语句
方法一
#include <stdio.h>#include <string.h>#define M 5int main(){ char *str[M] = {"China", "Japan", "Korea", "American", "England"}; for (int j = 0; j < M; j++) { for (int i = 0; i < M - j - 1; i++) { if (strcmp(str[i], str[i + 1]) > 0) { char *temp; temp = str[i]; str[i] = str[i + 1]; str[i + 1] = temp; } } printf("%s ", str[j]); } printf("\n"); for (int i = 0; i < M; i++) { printf("%s ", str[i]); } return 0;}//输出//China American England Japan Korea//American China England Japan Korea//排序过程//C J K A E//C J K A E//C J A K E//C J A E K
//C J A E K//C A J E K//C A E J K
//A C E J K//A C E J K
//A C E J K方法二
详解见www.yujing.fit,字符排序
#include <stdio.h>#include <string.h>void main() { char *n[]= {"China","Japan","Korea","American","England"},*temp; int i,j,k; for(i=0; i<5; i++) { k=i; for(j=i+1; j<5; j++) if(strcmp(n[k],n[j])>0) k=j; if(k!=i) { temp=n[k]; n[k]=n[i]; n[i]=temp; } printf("%s ",n[i]); }}方法三
简单选择排序
这个在内部输出正确的,是因为在完成第一次内部循环时,排序为A J K C E,输出了str[0],即”American”
第二次内部循环时,排序为A C J K E,输出了str[1],即”China”,
…余下同样原理,
不具有普遍性,不建议使用
#include <stdio.h>#include <string.h>#define M 5int main(){ char *str[M] = {"China", "Japan", "Korea", "American", "England"}; for (int i = 0; i < M; i++) { for (int j = i+1; j < M ; j++) { if (strcmp(str[i], str[j]) > 0) { char *temp; temp = str[i]; str[i] = str[j]; str[j] = temp; } } printf("%s ", str[i]);//最好不在内部输出,另起一个循环输出 } return 0;}//排序过程//C J K A E//C J K A E//A J K C E//A J K C E
//A J K C E//A C K J E//A C J K E
//A C J K E//A C E K J
//A C E J K数组插入排序
方法一
思路:找到位置,然后将数组元素一个一个后移.
#include <stdio.h>int main(){ int a[10] = {10, 20, 30, 40, 50, 60, 70, 80, 90}; int b = 35; for (int i = 0; i < 10; i++) { if ((a[i] < b) && (a[i + 1] > b)) { for (; i < 10; i++) { int temp; temp = a[i + 1]; a[i + 1] = b; b = temp; } } } for (int i = 0; i < 10; i++) { printf("%d ", a[i]); } return 0;}方法二
思路:直接插入到最后一个位置,然后再对整体重新排序
代码
待实现
方法三
思路与方法一差不多相同
不过用的指针
#include <stdio.h>int main(){ int a[10] = {10, 20, 30, 40, 50, 60, 70, 80, 90}; int *p,b = 35; for (p=&a[8]; (p>a)&&(*p>b); p--) { *(p+1)=*p; } p++; *p=b; for (p=a; p < a+10; p++) { printf("%d ", *p); } return 0;}判断日期为今年多少天
思路: 先判断出是否为闰年,再分别计算出天数
#include <stdio.h>int main(){ struct day { int year; int month; int day; }today,*p; int sum; p=&today; scanf("%d%d%d",&p->year,&p->month,&p->day); if ((p->year%4==0)&&(p->year%100!=0)||(p->year%400==0))//判断闰年 { switch (p->month-1) { case 12:sum+=31; case 11:sum+=30; case 10:sum+=31; case 9:sum+=30; case 8:sum+=31; case 7:sum+=31; case 6:sum+=30; case 5:sum+=31; case 4:sum+=30; case 3:sum+=31; case 2:sum+=29; case 1:sum+=31;break; default: break; } sum+=p->day; printf("%d/%d is the %dth day in %d.",p->month,p->day,sum,p->year); }else{ switch (p->month-1) { case 12:sum+=31; case 11:sum+=30; case 10:sum+=31; case 9:sum+=30; case 8:sum+=31; case 7:sum+=31; case 6:sum+=30; case 5:sum+=31; case 4:sum+=30; case 3:sum+=31; case 2:sum+=28; case 1:sum+=31;break; default: break; } sum+=p->day; printf("%d/%d is the %dth day in %d.",p->month,p->day,sum,p->year); }
return 0;}方法二
思路:先计算出一般情况下的天数,再判断是否为闰年且当前月数大于2,如条件成立,天数将会多上2月29日那一天.
#include <stdio.h>int main(){ struct day { int year; int month; int day; }today,*p; int sum=0; p=&today; scanf("%d%d%d",&p->year,&p->month,&p->day); switch (p->month-1) { case 12:sum+=31; case 11:sum+=30; case 10:sum+=31; case 9:sum+=30; case 8:sum+=31; case 7:sum+=31; case 6:sum+=30; case 5:sum+=31; case 4:sum+=30; case 3:sum+=31; case 2:sum+=28; case 1:sum+=31;break; default: break; } if (((p->year%4==0)&&(p->year%100!=0)||(p->year%400==0))&&(p->month)>2)//判断闰年,,且月数大于两个月,日期将会多上2月29那一天,所以sum+1 { sum++; } sum+=p->day; printf("%d/%d is the %dth day in %d.",p->month,p->day,sum,p->year); return 0;}排序???
要求: 按照字母顺序排列,不区分大小写.
例: a(ASClL码97) 应该排列在 B(ASCLL码66)的前面.
A(ASClL码65) 也应该排列在 B(ASCLL码66)的前面.
思路1:统一字符大小写,将所有字母统一改为小写,即ASCLLL码在65~90范围的字母,加上32,转换为小写,再根据ASCLL码由小到大排序.
问题: ASCLLL码在65~90范围的字母,加上32,转换为小写, 暂时无法实现
strlwr()函数,将所有大写字母转化为小写.
#include <stdio.h>#include <string.h>#define M 8int main(){ char *str[M]={"BASIC","Computer","design","FORTRAN","Follow","me","Great","Wall"};
for (int i = 0; i < M; i++) { for (int j = 0; j < strlen(str[i]); j++) { if ((int)*(str[i]+j)<97)//判断大写字母 { // *(str[i]+j)+=32; printf("%c ",*(str[i]+j)+32); } // printf("%c ",*(str[i]+j)); } printf("%s ",str[i]); } return 0;}实现!!!
#include <stdio.h>#include <string.h>#define M 8 //单词个数#define N 10 //单词最大长度int main(){ char str[M][N] = {"BASIC", "Computer", "design", "ancestor", "Follow", "English", "Great", "Horion"}, str1[M][N]; for (int i = 0; i < M; i++) { strcpy(str1[i], str[i]);//复制到str1,不改变内容,只改变顺序. strlwr(str1[i]);//将str1改为小写输出 } for (int j = 0; j < M; j++)//冒泡排序 { for (int i = 0; i < M - j - 1; i++) { if (strcmp(str1[i],str1[i + 1]) > 0)//注意!!!!惊天妙手,为什么要两个数组的都要交换? { char temp[N]; strcpy(temp, str[i]);//字符串的赋值方式!! strcpy(str[i], str[i + 1]); strcpy(str[i + 1], temp);
strcpy(temp, str1[i]); //因为要保持数据的一致性 strcpy(str1[i], str1[i + 1]); strcpy(str1[i + 1], temp); } } } for (int i = 0; i < M; i++)//输出 { printf("%s ", str[i]); } return 0;}//输出//ancestor BASIC Computer design English Follow Great Horion对10个整数由大到小排序
指针
思路:10次外循环,第一次循环输出最大的,第二次循环输出第二大的,以此类推。
注意:这将会改变原数组内的值。且输入的整数不可以有负数,否则将排序错乱。
#include <stdio.h>int main(){ int a[10], *p; for (p = a; p < a + 10; p++) { scanf("%d", p); } for (int j = 0; j < 10; j++) { for (int i = 0; i < 10; i++) { if (*p < a[i]) { p = &a[i]; } } printf("%d ", *p); *p=0; //将指向最大的数,重新赋值为0,下次循环将找出第二大的, } return 0;}多此一举,画蛇添足
#include <stdio.h>int main(){ int a[10],b[10], *p,*q; for (p = a; p < a + 10; p++) { scanf("%d", p); } for (p = a,q=b; p < a + 10; p++,q++)//复制数组 { *q=*p; } p=a; for (int j = 0; j < 10; j++) { for (int i = 0; i < 10; i++) { if (*p < a[i]) { p = &a[i]; } } int temp; temp=*p; *p=b[j]; b[j]=temp; *p=0; } for (p = a; p < a + 10; p++) { printf("%d ", *p); } printf("\n"); for (q = b; q < b + 10; q++) { printf("%d ", *q); } return 0;}冒泡排序法
对数组利用冒泡排序法,重新排序,不会改变数组内的值,但会改变存储顺序.
#include <stdio.h>int main(){ int a[10], *p; for (p = a; p < a + 10; p++) { scanf("%d", p); } for (int i = 0; i < 10; i++) { for (p = a; p < a + 10-i; p++) { if (*p<*(p+1)) { int temp; temp=*p; *p=*(p+1); *(p+1)=temp; } } } for (p = a; p < a + 10; p++) { printf("%d ", *p); } return 0;}如不想改变原数组,可以复制出一个数组进行排序操作.
动态输出
思考:有没办法一个输出语句实现?
#include <stdio.h>struct student { int num; float Chinese; float English; float math; float physical; }stu1={0,60,70,80,90},stu2={1,56,89,67,88},stu3={34,78,90,66};int main(){ int print(int num),i; scanf("%d",&i); print(i); return 0;}int print(int num){ switch (num) { case 0: printf("%.2f %.2f %.2f %.2f",stu1.Chinese,stu1.English,stu1.math,stu1.physical); break; case 1: printf("%.2f %.2f %.2f %.2f",stu2.Chinese,stu2.English,stu2.math,stu2.physical); break; case 2: printf("%.2f %.2f %.2f %.2f",stu3.Chinese,stu3.English,stu3.math,stu3.physical); break; default: break; } return 0;}输出1~200之间的所有素数
思路没错,差点细节
思路:循环判断3-199之间的所有数 i ,每次将其循环与2到当前数本身减去1,即 i % j 取余,
如遇到一个可以被整除的,那么i就不是素数,将flag赋值为0,标志当前的i不为素数,以便后面进行判断。且不必再进行判断后面的j了,直接break跳出内循环。
#include <stdio.h>
int main(){ int a[100],flag=1; for (int i = 3; i < 200; i++)//i为1~200内的整数 { for (int j = 2; j < i; j++) { if (i%j==0) { flag=0; break; } } if (flag==1) { int k=0;//不能再内部赋值,否则每次循环执行时.将会重新赋值 a[k]=i; k++; } } for (int i = 0; i < 100; i++)//不能直接输出全部,有的并没有值 { printf("%d ",a[i]); } return 0;}修正代码如下
#include <stdio.h>
int main(){ int a[100],flag=1,k=1; a[0]=2; for (int i = 3; i < 200; i++)//i为3~200内的整数 { for (int j = 2; j < i; j++) { if (i%j==0)//判断_如果i被j整除了,那么i不是素数,后面不用再循环判断,break跳出循环. { flag=0;//i不是素数 break; } } if (flag==1) { a[k]=i; k++; } flag=1; //每次循环完,将flag重新赋值为1!!! } for (int i = 0; i < k; i++)//总共有k个素数 { printf("%d ",a[i]); } return 0;}稍微修改
输入一个数,判断是否为素数.
#include <stdio.h>
int main(){ int a, flag = 1; printf("请输入一个整数:"); scanf("%d", &a); for (int j = 2; j < a; j++) { if (a % j == 0) //判断_如果a被j整除了,那么a不是素数,后面不用再循环判断,break跳出循环. { flag = 0; //a不是素数 printf("%d不是一个素数,它能被%d整除", a,j); break; } } if (flag == 1) { printf("%d是一个素数", a); } return 0;}输入两个整数,求其最大公约数和最小公倍数
#include <stdio.h>
int main(){ int hcf(int a, int b); //最大公约数 int lcd(int a, int b); //最小公倍数 int a, b; scanf("%d%d", &a, &b); hcf(a, b); printf("\n"); lcd(a, b); return 0;}int hcf(int a, int b){ for (int i = a < b ? a : b; i > 0; i--) { if (a % i == 0 && b % i == 0) { printf("hcf=%d", i); break; } } return 0;}int lcd(int a, int b){ for (int i = 1; i <= a * b; i++) { if (i % a == 0 && i % b == 0) { printf("lcd=%d", i); break; } } return 0;}二维数组行列互换
#include <stdio.h>
int main(){ int a[3][4]={1,4,5,6,3,2,7,8,7,9,0,3}; for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { printf("%d ",a[i][j]); } printf("\n"); } printf("\n"); int b[4][3]; for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { b[j][i]=a[i][j]; } } for (int i = 0; i < 4; i++) { for (int j = 0; j < 3; j++) { printf("%d ",b[i][j]); } printf("\n"); } return 0;}//输出//1 4 5 6//3 2 7 8//7 9 0 3
//1 3 7//4 2 9//5 7 0//6 8 3统计不相同的数据个数
借鉴的
思路:!!!!很重要
循环遍历需判断的10个数,当往后找不出相同的数时,计数加1.
例:样例1,当循环第一个数时,往后没有1了,计数加1
样例2,当循环第一个数时,往后还有1,直接跳出循环,进行下次判断,循环第二个数,但第二个数还是1,继续跳出循环,直到第5次循环,往后再没有1了,则计数加1.
#include <stdio.h>#include <stdlib.h>int main(){ int *a, i, j; a = (int *)malloc(sizeof(int) * 10); //创建一个int形 10个int大小的存储空间 for (i = 0; i < 10; i++) //输入 scanf("%d", a + i); int flag = 0; //计数不同个数,初始值为0 for (i = 9; i >= 0; i--) { for (j = i - 1; j >= 0; j--) if (*(a + i) == *(a + j)) break; if (j == -1) flag++; } printf("%d", flag); return 0;}实践
#include <stdio.h>#define M 10 //数组长度,即需要判断的数据长度int main(){ int a[M],sum=0,flag=1; for (int i = 0; i < M; i++) { scanf("%d",&a[i]); } for (int i = 0; i < M; i++) { for (int j = i+1; j < M; j++) { if (a[i]==a[j])//循环判断到 最后一个 { flag=0; break; } } if (flag==1) { sum++; } flag=1; } printf("%d",sum); return 0;}删除数据中重复出现的数据
将以上代码稍作修改
#include <stdio.h>#define M 10 //数组长度,即需要判断的数据长度int main(){ int a[M],flag=1; for (int i = 0; i < M; i++) { scanf("%d",&a[i]); } for (int i = 0; i < M; i++) { for (int j = i+1; j < M; j++) { if (a[i]==a[j])//循环判断到 最后一个 { flag=0; break; } } if (flag==1) { printf("%d ",a[i]); } flag=1; } return 0;}其实并不严谨,没有删除数组中的重复的值,并没有改变数组的值,只是选择性的将多余重复的值不打印出来
再稍加修改
定义一个数组b,将未重复的都存入b中,即相当于把数组a中重复的值删除后,存入数组b中,
#include <stdio.h>#define M 10 //数组长度,即需要判断的数据长度int main(){ int a[M],b[M],sum=0,flag=1; for (int i = 0; i < M; i++) { scanf("%d",&a[i]); } for (int i = 0; i < M; i++) { for (int j = i+1; j < M; j++) { if (a[i]==a[j])//循环判断到 最后一个 { flag=0; break; } } if (flag==1) { b[sum]=a[i]; sum++; } flag=1; } for (int i = 0; i < sum; i++) { printf("%d ",b[i]); } return 0;}斐波那契数列问题
求前20项
#include <stdio.h>
int main(){ int a[20]={1,1}; for (int i = 0; i < 20;i++) { a[i+2]=a[i]+a[i+1]; } for (int i = 0; i < 20; i++) { printf("%d ",a[i]); } return 0;}统计各个相同的个数
#include <stdio.h>#include <string.h>int main(){ char str[10]; int sum=1;//计数,初始为1 gets(str); for (int i = 0; i < strlen(str); i++) { for (int j = i+1; j < strlen(str); j++) { if (str[i]==str[j]) { sum++;//循环到相同的,计数加一 } } printf("%c:%d\n",str[i],sum); sum=1; } return 0;}倒序输出
#include <stdio.h>int main(){ int a[10]; for (int i = 0; i < 10; i++) { a[i]=i; } for (int i = 9; i >= 0; i--) { printf("%d ",a[i]); } return 0;}求二维数组最大值,及其所在的行列
#include <stdio.h>#include <string.h>int main(){ int a[3][4]={1,2,3,4,9,8,7,6,-10,10,-5,2},max=a[0][0],m,n; for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { if (max<a[i][j]) { max=a[i][j]; m=i; n=j; } } } printf("max=%d row=%d colum=%d",max,m,n); return 0;}统计单词个数
#include <stdio.h>#include <string.h>#define M 20int main(){ char str[M]; int sum=1; gets(str); for (int i = 0; i < strlen(str); i++) { if (str[i]==' ') { sum++; } } printf("%d",sum); return 0;}可想到统计空格个数,因单词之间都用的空格隔开,即单词个数等于空格数加1
比较3个字符串
#include <stdio.h>#include <string.h>int main(){ char str1[20], str2[20], str3[20]; scanf("%s%s%s",&str1,&str2,&str3); if (strcmp(str1, str2) < 0) { if (strcmp(str3, str2) < 0) { printf("%s", str2); } else { printf("%s", str3); } } else { printf("%s", str1); }
return 0;}改进:
稍加修改可比较更多个字符串,不限制于一个单词的字符串
#include <stdio.h>#include <string.h>#include <stdlib.h>int main(){ char *str[3],*max; for (int i = 0; i < 3; i++) { str[i]=(char*)malloc(3*sizeof(char)); } for (int i = 0; i < 3; i++) { gets(str[i]); } max=str[0]; for (int i = 0; i < 3; i++) { if (strcmp(max,str[i])<0) { max=str[i]; } } printf("%s",max); return 0;}找最小,交换位置
#include <stdio.h>#include <string.h>#include <stdlib.h>int main(){ int a[10] = {87, 78, 69, 79, 98, 86, 91, 75, 71, 95}; int k, Min = a[0]; for (int j = 1; j < 10; j++) { if (Min > a[j]) { Min = a[j]; k = j; } } int temp; temp=a[k]; a[k]=a[0]; a[0]=temp; printf("Min=a[%d]=%d\n", k, Min); for (int i = 0; i < 10; i++) { printf("%d ",a[i]); }
return 0;}杨辉三角
#include <stdio.h>#define M 10int main(){ int a[M] = {1}, b[M] = {1, 1}; printf("1\n"); for (int i = 1; i < M; i++) //需要得到多少层的数据M { printf("1 "); if (i % 2 == 0) { a[i] = 1; for (int j = 1; j < i; j++) { a[j] = b[j - 1] + b[j]; printf("%d ", a[j]); } } else { b[i] = 1; for (int j = 1; j < i; j++) { b[j] = a[j - 1] + a[j]; printf("%d ", b[j]); } } printf("1\n"); } return 0;}//输出11 11 2 11 3 3 11 4 6 4 11 5 10 10 5 11 6 15 20 15 6 11 7 21 35 35 21 7 11 8 28 56 70 56 28 8 11 9 36 84 126 126 84 36 9 1核心,
可得出中间部分,即除去最外层固定为1的部分.
for (int i = 2; i < M; i++) //需要得到多少层的数据M { for (int j = 1; j < i ; j++) { if (i % 2 == 0) { a[j]=b[j-1]+b[j]; printf("%d ",a[j]); } else { b[j]=a[j-1]+a[j]; printf("%d ",b[j]); } } }找数组中最大值和最小值
#include <stdio.h>
int main(){ int a[8]; for (int i = 0; i < 8; i++) { scanf("%d",&a[i]); } int max=a[0],min=a[0]; for (int i = 1; i < 8; i++) { if (min>a[i]) { min=a[i]; } } printf("最小值是:%d\n",min); for (int i = 1; i < 8; i++) { if (max<a[i]) { max=a[i]; } } printf("最大值是:%d",max); return 0;}寻找替换
在s串中,寻找t串,将之替换为g串.
#include <stdio.h>#include <string.h>int main(){ int replace_str(char *s, char *t, char *g); //替换 char *s, *t, *g; char s1[20], t1[5], g1[10]; s = s1; t = t1; g = g1; gets(s); gets(t); gets(g); replace_str(s, t, g); return 0;}int replace_str(char *s, char *t, char *g){ int count = 0; //计数 char str1[100]; char *str; str = str1; int p = 0; //记录str存储进度 for (int i = 0; i < strlen(s); i++) { int k = 0; //循环t的比较进度 int m = 0; //记录单字符相等次数 for (int j = i; j < strlen(t) + i; j++, k++) { if (*(s + j) == *(t + k)) { m++; } } if (m == strlen(t)) //标志在s串中找到一处与t串相同 { for (int n = 0; n < strlen(g); n++) { *(str + p) = *(g + n); p++; } count++; i+=(strlen(t)-1);//跳过下..次循环 } else { *(str + p) = *(s + i); p++; } } *(str + p) = '\0'; printf("%s\n", str); printf("count=%d\n", count); return 0;}题解
#include <stdio.h>#include <string.h>
int replace_str( char *s, char *t, char *g );
int findsub( char *a, char *b );
int main( void ){ char s[100], t[20], g[20]; int count; scanf( "%s %s %s", &s, &t, &g ); count = replace_str( s, t, g ); printf( "%s count=%d", s, count ); return(0);}
int replace_str( char *s, char *t, char *g ){ char tempstr[100]; int position, k, tail;
if ( strlen( s ) == 0 ) return(0); position = findsub( s, t ); if ( position == -1 ) return(0); k = strlen( t ); strcpy( tempstr, s + position + k ); s[position] = '\0'; strcat( s, g ); tail = strlen( s ); strcat( s, tempstr ); return(1 + replace_str( s + tail, t, g ) );}
int findsub( char *a, char *b ){ int i, j, k;
for ( i = 0; a[i] != '\0'; i++ ) { for ( j = i, k = 0; a[j] == b[k] && k < strlen( b ); j++, k++ ) ; if ( b[k] == '\0' ) return(i); } return(-1);}报数游戏
#include <stdio.h>#include <string.h>int main(){ int n;//总人数 scanf("%d",&n); int a[100]; for (int i = 0; i < n; i++)//顺序排号 { a[i]=i+1; // printf("%d ",a[i]); } int k=0;//报数 int m=0;//记录退出圈子的个数 int last; for (int i = 0; i < n; i++) { if (a[i]!=0)//除去为0的 { k++;//报数 } if (k==3)//报到3退出, { a[i]=0;//赋值为0,代表退出圈子; m++; //记录一个退出 k=0; //重新将k赋值,下次重新报数到3 } if ((n-m)<3) //当剩余的人数不足以报数到3的时候,结束循环 { for (int j = i; j < n; j++) {
if (a[j]!=0) { last=a[j]; k++; } if (j==(n-1)) { j=-1; } if (k==2) { break; } } break; } if (i==(n-1))//围成一圈,无限循环 { i=-1;//当循环到最后一个时,将i重新赋值到第一个.因为会执行一次i++,所以要赋值为-1,否则会跳过第一个. } } printf("%d",last); return 0;}改进一点
#include <stdio.h>int main(){ int n;//总人数 scanf("%d",&n); int a[100]; for (int i = 0; i < n; i++)//顺序排号 { a[i]=i+1; // printf("%d ",a[i]); } int k=0;//报数 int m=0;//记录退出圈子的个数 int last; for (int i = 0; i < n; i++) { if (a[i]!=0)//除去为0的 { k++;//报数 } if (k==3)//报到3退出, { a[i]=0;//赋值为0,代表退出圈子; m++; //记录一个退出 k=0; //重新将k赋值,下次重新报数到3 } if ((n-m)==1) //当剩最后一人的时候,结束循环 { for (int j = 0; j < n; j++) { if (a[j]!=0) { last=a[j]; } } break; } if (i==(n-1))//围成一圈,无限循环 { i=-1;//当循环到最后一个时,将i重新赋值到第一个.因为会执行一次i++,所以要赋值为-1,否则会跳过第一个. } } printf("%d",last); return 0;}