首页 C 语言

# 团队作业

# 数组

# 第一题：查找指定字符

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include<stdio.h>
#include<string.h>

int main()
{
	char ch[80] = {0};
	char index;
	int i = 0, len = 0;
	
	scanf("%c",&index);	
	scanf("%s",ch);
	
	len = strlen(ch);
	
	for (i = len; i >=0; i--)
	{
		if (ch[i] == index)
		{
			printf("index = %d",i + 1);
			break;
		}
	}
}

# 第二题：选择法排序

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
#include<stdio.h>
#define MAX 10

int main()
{
	int n = 0, i = 0, j = 0;
	int temp_num = 0;
	int num[MAX] = {0};
	
	scanf("%d",&n);
	getchar();
	
	while (1)
	{
		scanf("%d",&num[i]);
		
		if (getchar() == '\n')
		{
			break;
		}
		i++;
	}
	
	for (i = 0; i < n; i++)
	{
		for (j = i + 1; j < n; j++)
		{
			if (num[i] <= num[j])
			{
				temp_num = num[i];
				num[i] = num[j];
				num[j] = temp_num;
			}
		}
	}
	
	i = 0;
	
	while (i < n)
	{
		if (i == n)
		{
			printf("%d",num[i]);
			break;
		}
		
		printf("%d ",num[i]);
		i++;
	}
	
	return 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
#include<stdio.h>
#define MAX 10 

int main()
{
	int matirix[MAX][MAX] = {0};
	int T = 0, count = 0;
	int line = 0, i = 0, j = 0;
	
	scanf("%d",&T);
	
	for (count = 0; count < T; count++)	
	{
		scanf("%d",&line);
		
		for (i = 0; i < line; i++)
		{
			for (j = 0; j < line; j++)
			{
				scanf("%d",&matirix[i][j]);
				
				if (getchar() == '\n')
				{
					break;
				}
			}
		}
		
		for (i = j = line -1;;i--,j--)
		{
			if (matirix[i][j] != 0)
			{
				printf("NO\n");
				break;
			}
			
			else if (matirix[i][j] == 0)
			{
				if(i == 0 && j == 0)
				{
				printf("YES\n");
				break;
				}
			}
		}
	}
	
	return 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
#include<stdio.h>
#define MAX 6

int main()
{
	int matirix[100][MAX] = {0};
	int m = 0, n = 0;
	int line = 0, row = 0;
	int sum = 0;
	
	scanf("%d %d",&m, &n);
	
	for (line = 0; line < m; line++)
	{
		for (row = 0; row < n; row++)
		{
			scanf("%d",&matirix[line][row]);
			
			if (getchar() == '\n')
			{
				break;
			}
		}
	}
	
	for (line = 0; line < m; line++)
	{
		for (row = 0; row < n; row++)
		{
			sum += matirix[line][row];
		}
		
		printf("%d\n",sum);
		sum = 0;
	}
	
	return 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
#include<stdio.h>
#define MAX 80

int exchange(int m, int n);
int comprasion(int m, int n);

int main()
{
	int i = 0, j = 0, k = 0;
	int num[MAX] = {0};
	int temp = 2, n = 0, count = 0;
	
	scanf("%d",&n);
	getchar();
	
	while (1)
	{
		scanf("%d",&num[i]);
		
		if (getchar() == '\n')
		{
			break;
		}
		
		i++;
	}
	
	for (i = 0; i < n; i++)		//min
	{
		for (j = i + 1; j < n; j++)
		{
			if (comprasion(num[i],num[j]))
			{
				i = j;
			}
			
			if (j == n - 1)
			{
				k = 0;
				k = num[i];
				num[i] = num[0];
				num[0] = k;
				goto a;
			}
		}
	}
	
a:	for (i = 0; i < n; i++)		//max
	{
		for (j = i + 1; j < n; j++)
		{
			if (comprasion(num[i],num[j]) == 0)
			{
				i = j;
			}
			
			if (j == n - 1)
			{
				k = 0;
				k = num[i];
				num[i] = num[n - 1];
				num[n - 1] = k;
				goto b;
			}
		}
	}
	
b:	for (i = 0; i < n; i++)
	{
		printf("%d ",num[i]);
	}
	
	return 0;
}

int exchange(int m, int n)
{
	int k = 0;
	
	k = m;
	m = n;
	n = k;
}

int comprasion(int m, int n)
{
	if (m > n)
	{
		return 1;
	}
	
	else
	{
		return 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
#include<stdio.h>
#define MAX 1000

int compare(int m,int n);

int main()
{
	int num[MAX] = {0};
	int sum[MAX] = {0};
	int i,j,n,count,temp_num,temp_sum;
	i = j = n = count = 0;
	
	scanf("%d",&n);
	getchar();
	
	for (i = 0; i < n; i++)
	{
		scanf("%d",&num[i]);
	}
	
	for (i = 0; i < n; i++)
	{
		for (j = i + 1; j < n; j++)
		{
			if (num[i] == num[j])
			{
				sum[i]++;
			}
		}
	}
	
	for (i = 0; i < n; i++)		//max
	{
		for (j = i + 1; j < n; j++)
		{
			if (compare(num[i],num[j]) == 0)
			{
				i = j;
			}
			
			if (j == n - 1)
			{
				temp_sum = sum[i];
				temp_num = num[i];
				goto a;
			}
		}
	}
	
a:	printf("%d %d",temp_num,temp_sum + 1);
	
	return 0;
	
}

int compare(int m,int n)
{
	if (m < n)
	{
		return 0;
	}
	
	else
	{
		return 1;
	}
}

# 第七题：字符转换

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
#include<stdio.h>
#include<math.h>

int main()
{
	int i = 0, num[80], count = 0;
	int num_1 = 0, temp = 0;
	
	while ((i = getchar()) != '\n')
	{
		if (i <= '9' && i >= '0')
		{
			count++;
			num[count] = i;
			num[count] -= '0';
		}
	}
	
	/*for (i = 1; i <= count; i++)
	{
		printf("%d\n",num[i]);
	}*/
	
	for (i = count; i >= 1; i--)
	{
		temp = pow(10,count - i);
		num_1 += (temp * num[i]);
	}
	
	printf("%d",num_1);
	
	return 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
#include<stdio.h>
#include<string.h>

int main()
{
	char ch[80] = {0};
	int i,j,len,k;
	i = j = len = k = 0;
	
	scanf("%80s",ch);
	
	len = strlen(ch);
	
a:	for (i = 0; i < len; i++)
	{
		for (j = i + 1; j < len; j++)
		{
			if (ch[i] == ch[j])
			{
				while (j < len)
				{
					ch[j] = ch[j + 1];
					j++;
				}
			}
		}
	}
	
	len = strlen(ch);
	
	for (i = 0; i < len; i++)
	{
		for (j = i + 1; j < len; j++)
		{
			if (ch[i] == ch[j])
			{
				goto a;
			}
		}
	}
	

	for (i = 0; i < len; i++)			//排序 
	{
		for (j = i + 1; j < len; j++)
		{
			if (ch[i] >= ch[j])
			{
				k = ch[i];
				ch[i] = ch[j];
				ch[j] = k;
			}
		}
	}
	
	for (i = 0; i < len; i++)			 
	{
		printf("%c",ch[i]);
	}
	
	return 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
#include<stdio.h>
#include<string.h>

int main()
{
	char ch[30] = {0};
	int i = 0, j = 0;
	
	gets(ch);
	
	for (i = 0; i < 30; i++)
	{
		if (ch[i] >= 97 && ch[i] <= 122)
		{
			ch[i] = ch[i] - 32;
			continue;
		}
		
		if (ch[i] >= 65 && ch[i] <= 90)
		{
			ch[i] = ch[i] + 32;
			continue;
		}
	}
	
	i = 0;
	
	while (1)
	{
		if (ch[i] == '#')
		{
			return 0;
		}
		
		printf("%c",ch[i]);
		i++;
	}
}

# 第十题：统计字符出现次数

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
#include<stdio.h>
#include<string.h>

int main()
{
	char ch[80] = {0};
	char index;
	int i,j,len,count;
	len = i = j = count = 0;
	
	scanf("%80s",ch);
	getchar();
	
	scanf("%c",&index);
	
	len = strlen(ch);
	
	while (i < len)
	{
		if (ch[i] == index)
		{
			count++;
		}
		i++;
	}
	
	printf("%d",count);
	
	return 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
#include<stdio.h>

void findmax(int *px, int *py, int *pmax);

int main()
{
	int max, x, y;
	
	scanf("%d %d",&x,&y);
	findmax(&x,&y,&max);
	printf("%d\n",max);
	
	return 0;
}

void findmax(int *px, int *py, int *pmax)
{
	if (*px > *py)
	{
		*pmax = *px;
	}
	
	else
	{
		*pmax = *py;
	}
}

# 第二题：计算两数的和与差

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
#include<stdio.h>

void sum_diff(float op1, float op2, float *psum, float *pdiff);

int main()
{
	float a, b, sum, diff;
	
	scanf("%f %f",&a,&b);
	sum_diff(a,b,&sum,&diff);
	printf("The sum is %.2f\nThe diff is %.2f\n",sum,diff);
	
	return 0;
}

void sum_diff(float op1, float op2, float *psum, float *pdiff)
{
	*psum = op1 + op2;
	*pdiff = op1 - op2;
}

# 第三题：拆分实数的整数与小数部分

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
#include<stdio.h>

void splitfloat(float x, int *intpart, float *fracpart);

int main()
{
	float x, fracpart;
	int intpart;
	
	scanf("%f",&x);
	splitfloat(x, &intpart, &fracpart);
	printf("The integer part is %d\n",intpart);
	printf("The fractional part is %f\n",fracpart);
	
	return 0;
}

void splitfloat(float x, int *intpart, float *fracpart)
{
	*intpart = x / 1;
	*fracpart = x - *intpart;
}

# 第四题：函数实现字符串逆序

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
#include<stdio.h>
#include<string.h>
#define MAXS 20

void f(char *p);
void ReadString(char *s);

int main()
{
	char s[MAXS];
	
	ReadString(s);
	f(s);
	
	printf("%s\n",s);
	
	return 0;
}

void ReadString(char *s)
{
	gets(s);
}

void f(char *p)
{
	int len = strlen(p);
	int count = (len + 1) / 2;
	char *a = p + (len - 1);
	
	
	for (int i = 0; i < count; i++,a--,p++)
	{
			char c;
			c = *a;
			*a = *p;
			*p = c;
	}
}

# 第五题：字符转换 (用指针完成)

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
#include<stdio.h>
#include<string.h>
#include<math.h>

int main()
{
	char *p;
	char s[80] = {0};
	int len = 0, i = 0, num = 0;
	int j = 0;
	char a[80] = {0};
	
	p = s;
	
	scanf("%80s",s);
	
	len = strlen(s);
	
	while (1)
	{
		if (*p >= '0' && *p <= '9')
		{
			a[i] = *p;
			i++;
		}
		
		if (j == len - 1)
		{
			break;
		}
		j++;
		p++;
	}
	
	len = strlen(a);
	
	for (i = 0; i < len; i++)
	{
		a[i] -= '0';
		num += pow(10,len - (i + 1)) * a[i];
	}
	
	printf("%d",num);
	
	return 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
#include<stdio.h>
#include<string.h>

int main()
{
	char sample[80] = {0};
	char loop[80] = {0};
	char *s = sample;
	char *l = loop;
	int len_1 = 0, len_2 = 0;
	int count = 0, sum = 0;
	
	scanf("%80s",sample);
	scanf("%80s",loop);
	
	len_1 = strlen(sample);
	len_2 = strlen(loop);
	
	for (int i = 0; i < len_1; i++,s++)
	{
		for (int j = 0; j < len_2; j++)
		{
			if (*(s+j) == *(l+j))
			{
				count++;
			}
			
			if (count == len_2)
			{
				count = 0;
				sum++;				//重复次数 
			}
		}
	}
	
	printf("%d",sum);
	
	return 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
#include<stdio.h>
#define MAXN 10

int search (int list[], int n, int x);

int main()
{
	int i, index, n, x;
	int a[MAXN];
	
	scanf("%d",&n);
	
	for (i = 0; i < n; i++)
	{
		scanf("%d",&a[i]);
	}
	
	scanf("%d",&x);
	
	index = search (a, n, x);
	
	if (index != -1)
	{
		printf("index = %d\n",index);
	}
	
	else
	{
		printf("Not Found\n");
	}
	
	return 0;
}

int search (int list[], int n, int x)
{
	for (int i = 0; i < n; i++)
	{
		if (list[i] == x)
		{
			return i;
		}
		
		if (i == n - 1)
		{
			return -1;
		}
	}
}

# 第二题：使用函数的选择法排序 (函数题)

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
#include<stdio.h>
#define MAXN 10

void sort (int a[], int n);

int main()
{
	int i, n;
	int a[MAXN];
	
	scanf("%d",&n);
	
	for (i = 0; i < n; i++)
	{
		scanf("%d",&a[i]);
	}
	
	sort(a, n);
	
	printf("After sorted the array is :");
	
	for (i = 0; i < n; i++)
	{
		printf("%d",a[i]);
	}
	
	printf("\n");
	
	return 0;
}

void sort (int a[], int n)
{
	for (int i = 0; i < n; i++)
	{
		for (int j = i + 1; j < n; j++)
		{
			if (a[i] >= a[j])
			{
				int temp = a[i];
				a[i] = a[j];
				a[j] = temp;
			}
			
			else
			{
				i = j;
			}
		}
	}
}

# 第三题：求最大值及其下标

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
#include<stdio.h>
#define MAX 10

void find_max(int num[], int n);

int main()
{
	int num[MAX] = {0};
	int n = 0;
	
	scanf("%d",&n);
	
	for (int i = 0; i < n; i++)
	{
		scanf("%d",&num[i]);
	}
	
	find_max(num,n);
	
	return 0;
}

void find_max(int num[], int n)
{
	for (int i = 0; i < n; i++)
	{
		for (int j = i + 1; i < n; j++)
		{
			if (num[i] >= num[j])
			{
				if (j == n - 1)
				{
					printf("%d %d",num[i],i);
				}
			}
			
			else
			{
				i = j;
			}
			
		}
	}
}

# 第四题：将数组中的数逆序存放

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
#include<stdio.h>
#define MAX 10

int main()
{
	int num[MAX] = {0};
	int n = 0;
	int *p, *a, temp;
	
	scanf("%d",&n);
	
	p = num;
	a = p + n - 1;
	
	for (int i = 0; i < n; i++)
	{
		scanf("%d",&num[i]);
	}
	
	for (int i = 0; i < n / 2; i++,p++,a--)
	{
		temp = *p;
		*p = *a;
		*a = temp;
	}
	
	for (int i = 0; i < n; i++)
	{
		printf("%d",num[i]);
		
		if (i != n - 1)
		{
			printf(" ");
		}
	}
}

# 第五题：找出不是两个数组共有的元素

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
#include<stdio.h>

void scan(int n, int m);
int num_1[20] = {0};
int num_2[20] = {0};

int main()
{
	int n1,n2;
	int count = 0;
	
	scanf("%d",&n1);
	scan(n1,1);
	
	for (int i = 0; i < n1; i++)		//删去num_1重复字符 
	{
		for (int j = i + 1; j < n1; j++)
		{
			if (num_1[i] == num_1[j])
			{
				num_1[j] = -1;
			}
		}
	}
	
	scanf("%d",&n2);
	scan(n2,2);
	
	for (int i = 0; i < n2; i++)		//删去num_2重复字符 
	{
		for (int j = i + 1; j < n2; j++)
		{
			if (num_2[i] == num_2[j])
			{
				num_2[j] = -1;
			}
		}
	}
	
	for (int i = 0; i < n1; i++)		//删去num_1与num_2重复字符 
	{
		for (int j = 0; j < n2; j++)
		{
			if (num_1[i] == num_2[j] && num_1[i] != -1)
			{
				num_1[i] = num_2[j] = -1;
			}
		}
	}
	
	for (int i = 0; i < n1; i++)		//输出 num_1 
	{
		if (num_1[i] != -1)
		{
			printf(" ");
			if (count == 0)
			{
				printf("\b");
				count++;
			}
			
			printf("%d",num_1[i]);
		}
	}
	
	for (int j = 0; j < n2; j++)		//输出 num_2 
	{
		if (num_2[j] != -1)
		{
			printf(" %d",num_2[j]);
		}
	}
}

void scan(int n,int m)			//输入数组 
{
	if (m == 1)
	{
		for (int i = 0; i < n; i++)
		{
			scanf("%d",&num_1[i]);
		}
	}
	
	else
	{
		for (int j = 0; j < n; j++)
		{
			scanf("%d",&num_2[j]);
		}
	}
}
更新于 阅读次数 次