实验5
任务1_1
1 #include <stdio.h> 2 #define N 5 3 4 void input(int x[], int n); 5 void output(int x[], int n); 6 void find_min_max(int x[], int n, int *pmin, int *pmax); 7 8 int main() { 9 int a[N]; 10 int min, max; 11 12 printf("录入%d个数据:\n", N); 13 input(a, N); 14 15 printf("数据是: \n"); 16 output(a, N); 17 18 printf("数据处理...\n"); 19 find_min_max(a, N, &min, &max); 20 21 printf("输出结果:\n"); 22 printf("min = %d, max = %d\n", min, max); 23 24 return 0; 25 } 26 27 void input(int x[], int n) { 28 int i; 29 30 for(i = 0; i < n; ++i) 31 scanf("%d", &x[i]); 32 } 33 34 void output(int x[], int n) { 35 int i; 36 37 for(i = 0; i < n; ++i) 38 printf("%d ", x[i]); 39 printf("\n"); 40 } 41 42 void find_min_max(int x[], int n, int *pmin, int *pmax) { 43 int i; 44 45 *pmin = *pmax = x[0]; 46 47 for(i = 0; i < n; ++i) 48 if(x[i] < *pmin) 49 *pmin = x[i]; 50 else if(x[i] > *pmax) 51 *pmax = x[i]; 52 }

问题1:在数组中找到最大值和最小值
问题2:pmin指向最小值的地址,pmax指向最大值的地址
任务1_2
1 #include <stdio.h> 2 #define N 5 3 4 void input(int x[], int n); 5 void output(int x[], int n); 6 int *find_max(int x[], int n); 7 8 int main() { 9 int a[N]; 10 int *pmax; 11 12 printf("录入%d个数据:\n", N); 13 input(a, N); 14 15 printf("数据是: \n"); 16 output(a, N); 17 18 printf("数据处理...\n"); 19 pmax = find_max(a, N); 20 21 printf("输出结果:\n"); 22 printf("max = %d\n", *pmax); 23 24 return 0; 25 } 26 27 void input(int x[], int n) { 28 int i; 29 30 for(i = 0; i < n; ++i) 31 scanf("%d", &x[i]); 32 } 33 34 void output(int x[], int n) { 35 int i; 36 37 for(i = 0; i < n; ++i) 38 printf("%d ", x[i]); 39 printf("\n"); 40 } 41 42 int *find_max(int x[], int n) { 43 int max_index = 0; 44 int i; 45 46 for(i = 0; i < n; ++i) 47 if(x[i] > x[max_index]) 48 max_index = i; 49 50 return &x[max_index]; 51 }

问题1:功能是找到数组里的最大值。返回到最大值的地址。
问题2:可以
任务2_1
1 #include <stdio.h> 2 #include <string.h> 3 #define N 80 4 5 int main() { 6 char s1[N] = "Learning makes me happy"; 7 char s2[N] = "Learning makes me sleepy"; 8 char tmp[N]; 9 10 printf("sizeof(s1) vs. strlen(s1): \n"); 11 printf("sizeof(s1) = %d\n", sizeof(s1)); 12 printf("strlen(s1) = %d\n", strlen(s1)); 13 14 printf("\nbefore swap: \n"); 15 printf("s1: %s\n", s1); 16 printf("s2: %s\n", s2); 17 18 printf("\nswapping...\n"); 19 strcpy(tmp, s1); 20 strcpy(s1, s2); 21 strcpy(s2, tmp); 22 23 printf("\nafter swap: \n"); 24 printf("s1: %s\n", s1); 25 printf("s2: %s\n", s2); 26 27 return 0; 28 }

问题1:1.80字节 2.获取整个数组占用的内存字节数 3.计算字符串有效字符长度
问题2:不能替换 char s1[N];定义的是字符数组 数组名是常量地址 不允许直接做赋值操作 s1=“字符串”;属于直接修改数组首地址,c语言不支持此写法,strcpy(s1,"Learning makes me happy")
问题3:可以交换
实验3
1 #include <stdio.h> 2 int main() { 3 int x[2][4] = {{1, 9, 8, 4}, {2, 0, 4, 9}}; 4 int i, j; 5 int *ptr1; // 指针变量,存放int类型数据的地址 6 int(*ptr2)[4]; // 指针变量,指向包含4个int元素的一维数组 7 printf("输出1: 使用数组名、下标直接访问二维数组元素\n"); 8 for (i = 0; i < 2; ++i) { 9 for (j = 0; j < 4; ++j) 10 printf("%d ", x[i][j]); 11 printf("\n"); 12 } 13 printf("\n输出2: 使用指针变量ptr1(指向元素)访问\n"); 14 for (ptr1 = &x[0][0], i = 0; ptr1 < &x[0][0] + 8; ++ptr1, ++i) { 15 printf("%d ", *ptr1); 16 if ((i + 1) % 4 == 0) 17 printf("\n"); 18 } 19 20 printf("\n输出3: 使用指针变量ptr2(指向一维数组)访问\n"); 21 for (ptr2 = x; ptr2 < x + 2; ++ptr2) { 22 for (j = 0; j < 4; ++j) 23 printf("%d ", *(*ptr2 + j)); 24 printf("\n"); 25 } 26 return 0; 27 }

问题1:是指向含有4个int元素的一组数组的指针
问题2:是包含4个int*类型指针元素的数组
实验4
1 #include <stdio.h> 2 #define N 80 3 void replace(char *str, char old_char, char new_char); 4 int main() { 5 char text[N] = "Programming is difficult or not, it is a question."; 6 printf("原始文本: \n"); 7 printf("%s\n", text); 8 replace(text, 'i', '*'); 9 printf("处理后文本: \n"); 10 printf("%s\n", text); 11 return 0; 12 } 14 void replace(char *str, char old_char, char new_char) { 15 int i; 16 while(*str) { 17 if(*str == old_char) 18 *str = new_char; 19 str++; 20 } 21 }

问题1:接受字符串首地址,待替换字符old_char,新字符new_char;利用指针遍历整个字符串,将字符串所有等于old_char的字符全部替换new_char
问题2:可以
实验五
1 #include <stdio.h> 2 #define N 80 3 char *str_trunc(char *str, char x); 4 5 int main() { 6 char str[N]; 7 char ch; 8 while(printf("输入字符串:"), gets(str) != NULL) { 9 printf("输入一个字符:"); 10 ch = getchar(); 11 printf("截断处理...\n"); 12 str_trunc(str, ch); 13 printf("截断处理后的字符串:%s\n\n", str); 14 getchar(); 15 } 16 return 0; 17 } 18 19 char *str_trunc(char *str, char x) 20 { 21 char *p = str; 22 while(*p && *p != x) 23 p++; 24 *p = '\0'; 25 return str; 26 }

问题1:用来吸收输入字符ch之后遗留在输入缓冲区的换行符\n
实验6
1 #include <stdio.h> 2 #include <string.h> 3 #define N 5 4 int check_id(char *str); 5 6 int main() 7 { 8 char *pid[N] = {"31010120000721656X", 9 "3301061996X0203301", 10 "53010220051126571", 11 "510104199211197977", 12 "53010220051126133Y"}; 13 int i; 14 for (i = 0; i < N; ++i) 15 if (check_id(pid[i])) 16 printf("%s\tTrue\n", pid[i]); 17 else 18 printf("%s\tFalse\n", pid[i]); 19 return 0; 20 } 21 22 int check_id(char *str) 23 { 24 if(strlen(str) != 18) 25 return 0; 26 char *p = str; 27 for(int i=0;i<17;i++,p++) 28 { 29 if(*p<'0'||*p>'9') 30 return 0; 31 } 32 if( (*p>='0'&&*p<='9') || (*p=='X') ) 33 return 1; 34 else 35 return 0; 36 }

实验7
1 #include <stdio.h> 2 #define N 80 3 void encoder(char *str, int n); 4 void decoder(char *str, int n); 5 6 int main() { 7 char words[N]; 8 int n; 9 printf("输入英文文本: "); 10 gets(words); 11 printf("输入n: "); 12 scanf("%d", &n); 13 14 printf("编码后的英文文本: "); 15 encoder(words, n); 16 printf("%s\n", words); 17 18 printf("对编码后的英文文本解码: "); 19 decoder(words, n); 20 printf("%s\n", words); 21 22 return 0; 23 } 24 25 void encoder(char *str, int n) 26 { 27 char *p = str; 28 while(*p) 29 { 30 if(*p >= 'a' && *p <= 'z') 31 *p = (*p - 'a' + n) %26 + 'a'; 32 else if(*p >= 'A' && *p <= 'Z') 33 *p = (*p - 'A' + n) %26 + 'A'; 34 p++; 35 } 36 } 37 38 void decoder(char *str, int n) 39 { 40 char *p = str; 41 while(*p) 42 { 43 if(*p >= 'a' && *p <= 'z') 44 *p = (*p - 'a' - n +26) %26 + 'a'; 45 else if(*p >= 'A' && *p <= 'Z') 46 *p = (*p - 'A' - n +26) %26 + 'A'; 47 p++; 48 } 49 }



实验8
1 #include <stdio.h> 2 #include<stdlib.h> 3 #include<string.h> 4 5 void sort(char* ps[], int n); 6 7 int main(int argc, char *argv[]) { 8 int i; 9 sort(argv + 1, argc - 1); 10 11 for(i = 1; i < argc; ++i) 12 printf("hello, %s\n", argv[i]); 13 system("pause"); 14 15 return 0; 16 } 17 void sort(char* ps[], int n) { 18 int i, j; 19 char *temp; 20 for (i = 0; i < n - 1; i++) { 21 for (j = 0; j < n - 1 - i; j++) { 22 if (strcmp(ps[j], ps[j + 1]) > 0) { 23 temp = ps[j]; 24 ps[j] = ps[j + 1]; 25 ps[j + 1] = temp; 26 } 27 } 28 } 29 }
(我的电脑运行不了这个,生成不出来exe)
浙公网安备 33010602011771号