实验5

task1_1

点击查看代码
#include<stdio.h>
#define N 5
void input(int x[],int n);
void output(int x[],int n);
void find_min_max(int x[],int n,int *pmin,int *pmax);
int main(){
	int a[N];
	int min,max;
	printf("录入%d个数据:\n",N);
	input(a,N);
	printf("数据是:\n");
	output(a,N);
	printf("数据处理...\n");
	find_min_max(a,N,&min,&max);
	printf("输出结果:\n");
	printf("min=%d,max=%d\n",min,max);
	return 0;
}
void input(int x[],int n){
	int i;
	for(i=0;i<n;i++){
		scanf("%d",&x[i]);
	}
}
void output(int x[],int n){
	int i;
	for(i=0;i<n;i++){
		printf("%d ",x[i]);
	}
	printf("\n");
}
void find_min_max(int x[],int n,int *pmin,int *pmax){
	int i;
	*pmin=*pmax=x[0];
	for(i=0;i<n;i++){
		if(x[i]<*pmin)
		*pmin=x[i];
		if(x[i]>*pmax)
		*pmax=x[i];
	}
}

屏幕截图 2025-12-11 165120
1.找到数组中最大最小元素
2.都指向数组起始地址
task1_2

点击查看代码
#include<stdio.h>
#define N 5
void input(int x[],int n);
void output(int x[],int n);
int *find_max(int x[],int n);
int main(){
	int a[N];
	int *pmax;
	printf("录入%d个数据:\n",N);
	input(a,N);
	printf("数据是:\n");
	output(a,N);
	printf("数据处理...\n");
	pmax=find_max(a,N);
	printf("输出结果:\n");
	printf("max=%d\n",*pmax);
	return 0;
} 
void input(int x[],int n){
	int i;
	for(i=0;i<n;i++){
		scanf("%d",&x[i]);
	}
}
void output(int x[],int n){
	int i;
	for(i=0;i<n;i++){
		printf("%d ",x[i]);
	}
	printf("\n");
}
int *find_max(int x[],int n){
	int max_index=0;
	int i;
	for(i=0;i<n;i++){
		if(x[i]>x[max_index])
		max_index=i;
	}
	return &x[max_index];
}

屏幕截图 2025-12-11 165550
1.找到数组最大元素地址并传回
2.可以
task2-1

点击查看代码
#include<stdio.h>
#include<string.h>
#define N 80
int main(){
	char s1[N]="Learning makes me happy";
	char s2[N]="Learning makes me sleepy";
	char tmp[N];
	printf("sizeof(s1)vs.strlen(s1):\n");
	printf("sizeof(s1)=%d\n",sizeof(s1));
	printf("strlen(s1)=%d\n",strlen(s1));
	printf("\nbefore swap:\n");
	printf("s1:%s\n",s1);
	printf("s2:%s\n",s2);
	printf("\nswapping...\n");
	strcpy(tmp,s1);
	strcpy(s1,s2);
	strcpy(s2,tmp);
	printf("\nafter swap:\n");
	printf("s1:%s\n",s1);
	printf("s2:%s\n",s2);
	return 0;
} 

屏幕截图 2025-12-11 170452
1.80 数组总共站的空间 有效字符串长度
2.不能,s1是数组首位地址
3.是
task2-2

点击查看代码
#include<stdio.h>
#include<string.h>
#define N 80
int main(){
	char *s1="Learning makes me happy";
	char *s2="Learning makes me sleepy";
	char *tmp;
	printf("sizeof(s1)vs.strlen(s1):\n");
	printf("sizeof(s1)=%d\n",sizeof(s1));
	printf("strlen(s1)=%d\n",strlen(s1));
	printf("\nbefore swap:\n");
	printf("s1:%s\n",s1);
	printf("s2:%s\n",s2);
	printf("\nswapping...\n");
	tmp=s1;
	s1=s2;
	s2=tmp;
	printf("\nafter swap:\n");
	printf("s1:%s\n",s1);
	printf("s2:%s\n",s2);
	return 0;
} 

屏幕截图 2025-12-11 170848
1.l所在地址,s1占用的内存,有效字符长度
可以,前者是字符数组名,这个是字符指针变量
task3

点击查看代码
#include<stdio.h>
int main(){
	int x[2][4]={{1,9,8,4},{2,0,9,4}};
	int i,j;
	int *ptr1;
	int(*ptr2)[4];
	printf("输出1:使用数组名、下标直接访问二维数组元素\n");
	for(i=0;i<2;i++){
		for(j=0;j<4;j++)
			printf("%d",x[i][j]);
			printf("\n");
	}
	printf("\n输出2:使用指针变量ptr1(指向元素)间接访问\n");
	for(ptr1=&x[0][0],i=0;ptr1<&x[0][0]+8;++ptr1,++i){
		printf("%d",*ptr1);
		if((i+1)%4==0)
		printf("\n");
	}
	printf("\n输出3:使用指针变量ptr2(指向一维数组)间接访问\n");
	for(ptr2=x;ptr2<x+2;++ptr2){
		for(j=0;j<4;j++)
		printf("%d",*(*ptr2+j));
		printf("\n");
	}
	return 0;
} 

屏幕截图 2025-12-11 171602
task4

点击查看代码
#include<stdio.h>
#define N 80
void replace(char *str,char old_char,char new_char);
int main(){
	char text[N]="Prgramming is difficult or not, it is a question.";
	printf("原始文本:\n");
	printf("%s\n",text);
	replace(text,'i','*');
	printf("处理后文本:\n");
	printf("%s\n",text);
	return 0;
} 
void replace(char *str,char old_char,char new_char){
	int i;
	while(*str){
		if(*str==old_char)
		*str=new_char;
		str++;
	}
}

屏幕截图 2025-12-11 171907
task5

点击查看代码
#include<stdio.h>
#define N 80
char *str_trunc(char *str,char x);
int main(){
	char str[N];
	char ch;
	while(printf("输入字符串:"),gets(str)!=NULL){
		printf("输入一个字符:");
		ch=getchar();
		printf("阶段处理...\n");
		str_trunc(str,ch);
		printf("阶段处理后的字符串:%s\n\n",str);
		getchar();
	}
	return 0;
}
char *str_trunc(char *str,char x){
	while(*str){
		if(*str==x)
		*str=0;
		else str++;
	}
	return str;
}

屏幕截图 2025-12-11 172114
task6

点击查看代码
#include<stdio.h>
#include<string.h>
#define N 5
int check_id(char *str);
int main(){
	char *pid[N]={"31010120000721656x",
				"3301061996x0203301",
				"53010220051126571",
				"510104199211197977",
				"53010220051126133y"
	};
	int i;
	for(i=0;i<N;++i){
		if(check_id(pid[i]))
		printf("%s\tTure\n",pid[i]);
		else
		printf("%s\tFalse\n",pid[i]);
	}
	return 0;
}
int check_id(char *str){
	int i;
	for(i=0;i<17;i++){
		if(str[i]<'0'||str[i]>'9')
		return 0;
	}
		if((str[i]<'0'||str[i]>'9')&&str[i]!='x')
		return 0;
		return 1;
}

屏幕截图 2025-12-11 172220
task7

点击查看代码
#include<stdio.h>
#define N 80
void encoder(char *str,int n);
void decoder(char *str,int n);
int main(){
	char words[N];
	int n;
	printf("输入英文文本:");
	gets(words);
	printf("输入n:");
	scanf("%d",&n);
	printf("编码后的英文文本:");
	encoder(words,n);
	printf("%s\n",words);
	printf("对编码后的英文文本解码:");
	decoder(words,n);
	printf("%s\n",words);
	return 0;
} 
void encoder(char *str,int n){
	n%=26;
	while(*str){
		if(*str>='a'&&*str<='z')
		*str=(*str-'a'+n)%26+'a';
		else if(*str>='A'&&*str<='Z')
		*str=(*str-'A'+n)%26+'A';
		str++;
	}
}
void decoder(char *str,int n){
	n%=26;
	while(*str){
		if(*str>='a'&&*str<='z')
		*str=(*str-'a'-n+26)%26+'a';
		else if(*str>='A'&&*str<='Z')
		*str=(*str-'A'-n+26)%26+'A';
		str++;
	}
}

屏幕截图 2025-12-11 172403
task8

点击查看代码
#include<stdio.h>
#include<string.h>
void sort(int n,char *argv[]);
int main(int argc,char *argv[]){
	int i;
	sort(argc-1,argv+1);
	for(i=1;i<argc;i++){
		printf("hello,%s\n",argv[i]);
	}
	return 0;
}
void sort(int n,char *argv[]){
	int i,j;
	char *temp;
	for(i=0;i<n-1;i++){
		for(j=0;j<n-1-i;j++){
			if(strcmp(argv[j],argv[j+1])>0){
				temp=argv[j];
				argv[j]=argv[j+1];
				argv[j+1]=temp;
			}
		}
	}
}

屏幕截图 2025-12-11 172616

posted @ 2025-12-11 17:27  牛汝顺  阅读(11)  评论(1)    收藏  举报