@TOC利用数组处理批量数据

最新推荐文章于 2021-06-22 17:31:47 发布

原创最新推荐文章于 2021-06-22 17:31:47 发布 · 158 阅读

0 ·

CC 4.0 BY-SA版权

本文通过多个示例展示了C语言中数组的使用方法，包括一维数组和二维数组的初始化、遍历、排序、字符串处理及矩阵操作等，旨在帮助初学者掌握数组的基本操作。

@TOC利用数组处理批量数据
例6.1

#include<stdio.h>
int main()
{
int a[10],i;
for(i=0;i<=9;i++)
a[i]=i;
for(i=9;i>=0;i--)
printf("%d",a[i]);
printf("\n");
return 0;
}
```![在这里插入图片描述](https://img-blog.csdnimg.cn/20190221153640663.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDYzOTE0Nw==,size_16,color_FFFFFF,t_70)例6.2
```c
#include<stdio.h>
int main()
{
int i;
int a[20]={1,1};
for(i=2;i<=19;i++)
a[i]=a[i-1]+a[i-2];
for(i=0;i<20;i++)
{
if(i%5==0)printf("\n");
printf("%12d",a[i]);
}
printf("\n");
return 0;
}
```![在这里插入图片描述](https://img-blog.csdnimg.cn/20190221153812513.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDYzOTE0Nw==,size_16,color_FFFFFF,t_70)例6.3
```c
#include<stdio.h>
int main()
{
int a[10],i,p,t;
printf("input 10 numbers:\n");
for(i=0;i<10;i++)
scanf("%d",a[i]);
printf("\n");
for(p=0;p<9;p++);
for(i=0;i<9-p;i++)
if(a[i]>a[i+1])
{t=a[i];a[i]=a[i+1];a[i+1}=t;}
printf("the sorted numbers:\n");
for(i=0;i<10;i++)
printf("%d",a[i]);
printf("\n");
return 0;
}
```![在这里插入图片描述](https://img-blog.csdnimg.cn/20190221154138595.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDYzOTE0Nw==,size_16,color_FFFFFF,t_70)例6.4
```c
#include<stdio.h>
int main()
{
int a[2][3]={{1,2,3},{4,5,6}};
int i,j,b[3][2];
printf("array a:\n");
for(i=0;i<2;i++)
{
for(j=0;j<3;j++)
{
printf("%5d",a[i][j]);
b[j][i]=a[i][j];
}
printf("\n");
}
printf("array b:\n");
for(i=0;i<3;i++)
{
for(j=0;j<2;j++)
printf("%5d",b[i][j]);
printf("\n");
}
return 0;
}

在这里插入图片描述例6.5

#include<stdio.h>
int main()
{
int i,j,row=0,colum=0,max;
int a[3][4]={{1,2,3,4},{9,8,7,6},{-10,10,-5,2}};
max=a[0][0];
for(i=0;i<=2;i++)
for(j=0;j<=3;j++)
if(a[i][j]>max)
{
max=a[i][j];
row=i;
colum=j;
}
printf("max=%d\nrow=%d\ncolum=%d\n",max,row,colum);
return 0;
}
```![在这里插入图片描述](https://img-blog.csdnimg.cn/20190221155422616.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDYzOTE0Nw==,size_16,color_FFFFFF,t_70)例6.6
```c
#include<stdio.h>
int main()
{
	char c[15]={'I',' ','a','m',' ','a',' ','s','t','u','d','e','n','t','.' };
int i;
for(i=0;i<15;i++)
printf("%c",c[i]);
printf("\n");
return 0;
}
```![在这里插入图片描述](https://img-blog.csdnimg.cn/20190221155552735.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDYzOTE0Nw==,size_16,color_FFFFFF,t_70)例6.7
```c
#include<stdio.h>
int main()
{
char diamond[ ][5]={{' ',' ','*'},{' ','*',' ','*'},{'*',' ',' ',' ','*'},{' ','*',' ','*'},{' ',' ','*'}};
int i,j;
for(i=0;i<5;i++)
{for(j=0;j<5;j++)
printf("%c",diamond[i][j]);
printf("\n");
}
return 0;
}
```![在这里插入图片描述](https://img-blog.csdnimg.cn/20190221155807771.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDYzOTE0Nw==,size_16,color_FFFFFF,t_70)例6.8
```c
#include<stdio.h>
int main()
{
	char string[81];
	int i,num=0,word=0;
	char c;
	gets(string);
	for(i=0;(c=string[i])!='\0';i++)
		if(c==' ') word=0;
		else if( word== 0)
{word=1;num++;
		}
		printf("There are %d words in this line.\n",num);
		return 0;
}

```![在这里插入图片描述](https://img-blog.csdnimg.cn/20190221160005268.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDYzOTE0Nw==,size_16,color_FFFFFF,t_70)

例6.9
```c
#include<stdio.h>
#include<string.h>
int main()
{

      char str[3][20];
	  char string[20];
	  int i;
      for(i=0;i<3;i++)
      gets(str[i]);
      if(strcmp(str[0],str[1])>0)
      strcpy(string,str[0]);
	  else
      strcpy(string,str[1] );
	  if(strcmp(str[2] ,string)>0)
      strcpy(string ,str[2]);
      printf("\nthe larest string is: \n%s\n",string);
	  return 0;}


```![在这里插入图片描述](https://img-blog.csdnimg.cn/20190221160230342.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80NDYzOTE0Nw==,size_16,color_FFFFFF,t_70)