1.task_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 = 1; i < n; ++i) 48 if(x[i] < *pmin) 49 *pmin = x[i]; 50 else if(x[i] > *pmax) 51 *pmax = x[i]; 52 }
①答：功能是找出五个数中的最大值和最小值
②答：pmin和pmax都指向x[0]存储的地址
（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 = 1; i < n; ++i) 47 if(x[i] > x[max_index]) 48 max_index = i; 49 50 return &x[max_index]; 51 }
①答：功能是返回五个数中最大值的地址
②答：可以。因为*ptr=&x[0]使(*ptr)=x[0],以此来储存最大值，最后ptr即为最大值的地址
2.task_2
(1)
1 #include <stdio.h> 2 #include <string.h> 3 #define N 80 4 5 int main() { 6 char s1[] = "Learning makes me happy"; 7 char s2[] = "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 }
①答：s1的大小为24个字节，sizeof(s1)计算的是s1占有24个字节，strlen(s1)统计的是s1中内容的长度有23个字节
②答：不能。因为此时s1[]大小未知，无法运行
③答：交换
(2)
1 #include <stdio.h> 2 #include <string.h> 3 #define N 80 4 5 int main() { 6 char *s1 = "Learning makes me happy"; 7 char *s2 = "Learning makes me sleepy"; 8 char *tmp; 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 tmp = s1; 20 s1 = s2; 21 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 }
①答：指针变量s1中存放的是该字符串中第一个字符的地址，sizeof(s1)计算的是字符串的地址占有8个字节，strlen(s1)统计的是字符串长度有23个字节
②答：可以。前者需提前定义长度，后者无需
③答：交换的两个字符串的地址，二者在内存存储单元中没交换
3.task_3
1 #include <stdio.h> 2 3 int main() { 4 int x[2][4] = {{1, 9, 8, 4}, {2, 0, 4, 9}}; 5 int i, j; 6 int *ptr1; 7 int(*ptr2)[4]; 8 9 printf("输出1: 使用数组名、下标直接访问二维数组元素\n"); 10 for (i = 0; i < 2; ++i) { 11 for (j = 0; j < 4; ++j) 12 printf("%d ", x[i][j]); 13 printf("\n"); 14 } 15 16 printf("\n输出2: 使用指向元素的指针变量p间接访问二维数组元素\n"); 17 for (ptr1 = &x[0][0], i = 0; ptr1 < &x[0][0] + 8; ++ptr1, ++i) { 18 printf("%d ", *ptr1); 19 20 if ((i + 1) % 4 == 0) 21 printf("\n"); 22 } 23 24 printf("\n输出3: 使用指向一维数组的指针变量q间接访问二维数组元素\n"); 25 for (ptr2 = x; ptr2 < x + 2; ++ptr2) { 26 for (j = 0; j < 4; ++j) 27 printf("%d ", *(*ptr2 + j)); 28 printf("\n"); 29 } 30 31 return 0; 32 }
①答：ptr表示的语义是x[0]的地址
②答：ptr表示的语义是是x[0][0]的地址
4.task_4
(1)
1 #include <stdio.h> 2 #define N 80 3 4 void replace(char *str, char old_char, char new_char); 5 6 int main() { 7 char text[N] = "c programming is difficult or not, it is a question."; 8 9 printf("原始文本: \n"); 10 printf("%s\n", text); 11 12 replace(text, 'i', '*'); 13 14 printf("处理后文本: \n"); 15 printf("%s\n", text); 16 17 return 0; 18 } 19 20 void replace(char *str, char old_char, char new_char) { 21 int i; 22 23 while(*str) { 24 if(*str == old_char) 25 *str = new_char; 26 str++; 27 } 28 }
①答：功能是将字符串中的i替换成*
②答：可以
（2）
1 #include <stdio.h> 2 #define N 80 3 4 void str_trunc(char *str, char x); 5 6 int main() { 7 char str[N]; 8 char ch; 9 10 printf("输入字符串: "); 11 gets(str); 12 13 printf("输入一个字符: "); 14 ch = getchar(); 15 16 printf("截断处理...\n"); 17 str_trunc(str, ch); 18 19 printf("截断处理后的字符串: %s\n", str); 20 21 } 22 23 void str_trunc(char *str, char x) { 24 while(*str) { 25 if(*str == x) 26 break; 27 str++; 28 } 29 *str='\0'; 30 }
5.task_5
(1)
1 #include <stdio.h> 2 #include <string.h> 3 void sort(char *name[], int n); 4 5 int main() { 6 char *course[4] = {"C Program", 7 "C++ Object Oriented Program", 8 "Operating System", 9 "Data Structure and Algorithms"}; 10 int i; 11 12 sort(course, 4); 13 14 for (i = 0; i < 4; i++) 15 printf("%s\n", course[i]); 16 17 return 0; 18 } 19 20 void sort(char *name[], int n) { 21 int i, j; 22 char *tmp; 23 24 for (i = 0; i < n - 1; ++i) 25 for (j = 0; j < n - 1 - i; ++j) 26 if (strcmp(name[j], name[j + 1]) > 0) { 27 tmp = name[j]; 28 name[j] = name[j + 1]; 29 name[j + 1] = tmp; 30 } 31 }
(2)
1 #include <stdio.h> 2 #include <string.h> 3 void sort(char *name[], int n); 4 5 int main() { 6 char *course[4] = {"C Program", 7 "C++ Object Oriented Program", 8 "Operating System", 9 "Data Structure and Algorithms"}; 10 int i; 11 12 sort(course, 4); 13 for (i = 0; i < 4; i++) 14 printf("%s\n", course[i]); 15 16 return 0; 17 } 18 19 void sort(char *name[], int n) { 20 int i, j, k; 21 char *tmp; 22 23 for (i = 0; i < n - 1; i++) { 24 k = i; 25 for (j = i + 1; j < n; j++) 26 if (strcmp(name[j], name[k]) < 0) 27 k = j; 28 29 if (k != i) { 30 tmp = name[i]; 31 name[i] = name[k]; 32 name[k] = tmp; 33 } 34 } 35 }
答：是内存中字符串的存储位置发生了交换
6.task_6
1 #include <stdio.h> 2 #include <string.h> 3 #define N 5 4 5 int check_id(char *str); 6 7 int main() { 8 char *pid[N] = {"31010120000721656X", 9 "330106199609203301", 10 "53010220051126571", 11 "510104199211197977", 12 "53010220051126133Y"}; 13 int i; 14 15 for (i = 0; i < N; ++i) 16 if (check_id(pid[i])) 17 printf("%s\tTrue\n", pid[i]); 18 else 19 printf("%s\tFalse\n", pid[i]); 20 21 return 0; 22 } 23 24 int check_id(char *str) { 25 int s,i,k=1,count=0; 26 char list[]={"0123456789X"}; 27 for (;*str!='\0';str++) 28 { 29 s=0; 30 count++; 31 for (i=0;list[i]!='\0';i++) 32 { 33 if (*str==list[i]) 34 { 35 s=1; 36 break; 37 } 38 } 39 if (s==0) 40 { 41 k=0; 42 break; 43 } 44 } 45 if (count!=18) 46 k=0; 47 return k; 48 }
7.task_7
1 #include <stdio.h> 2 #define N 80 3 void encoder(char *str); 4 void decoder(char *str); 5 6 int main() { 7 char words[N]; 8 9 printf("输入英文文本: "); 10 gets(words); 11 12 printf("编码后的英文文本: "); 13 encoder(words); 14 printf("%s\n", words); 15 16 printf("对编码后的英文文本解码: "); 17 decoder(words); 18 printf("%s\n", words); 19 20 return 0; 21 } 22 23 void encoder(char *str) { 24 for (;*str;str++) 25 { 26 if (*str>='A'&&*str<='z') 27 { 28 if (*str=='z') 29 *str='a'; 30 else if (*str=='Z') 31 *str='A'; 32 else 33 *str+=1; 34 } 35 } 36 } 37 38 void decoder(char *str) { 39 for (;*str;str++) 40 { 41 if (*str>='A'&&*str<='z') 42 { 43 if (*str=='a') 44 *str='z'; 45 else if (*str=='A') 46 *str=='Z'; 47 else 48 *str-=1; 49 } 50 } 51 }
