-
Notifications
You must be signed in to change notification settings - Fork 1
/
2012-2-17指针.c
386 lines (308 loc) · 5.76 KB
/
2012-2-17指针.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
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
//用指针完成数组元素的存数及数据的反向输出
//
//
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define LEN 5
void init(int num[], int len)
{
int *p;
srand(time(NULL));
for(p = num; p < num + len; p++)
printf("%d ", *p = rand() % 50);
printf("\n");
}
void opp(int num[], int len)
{
int *p;
for(p = num + len - 1; p >= num; p--)
printf("%d ", *p);
printf("\n");
}
int main(void)
{
int num[LEN];
init(num, LEN);
opp(num, LEN);
return 0;
}
//函数实现:删除字符数组中的空格:自己改成函数实现
//
//
#include <stdio.h>
#include <string.h>
#define LEN 100
int main(void)
{
char str[LEN];
int i, j;
fgets(str, LEN, stdin);
printf("str:%s\n", str);
if(str[strlen(str) - 1] == '\n')
str[strlen(str) - 1] = '\0';
for(i = j = 0; str[i] != '\0'; i++)
if(str[i] != ' ')
str[j++] = str[i];
str[j] = '\0';
printf("str:%s\n", str);
return 0;
}
//猜数:首先生成一个介于1-100之间的整数,从
//键盘不断输入数值直到该数值与生成的那个数
//相符为止,并打印出猜数的次数
//
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void create(int *secretp)
{
srand(time(NULL));
*secretp = rand() % 100 + 1;
}
void guess(int secret)
{
int n, count = 1;
while(1){
printf("enter a number:");
scanf("%d", &n);
if(n == secret){
printf("You get it by %d times!\n", count);
break;
}
if(n > secret)
printf("Too high!\n");
else
printf("Too low!\n");
count++;
}
}
int main(void)
{
int secret;
create(&secret);
guess(secret);
return 0;
}
//生成26个排列好的英文字母
//
//
//
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void create(char letter[], int len)
{
int i, tmp;
srand(time(NULL));
for(i = 0; i < 26; ){
tmp = rand() % 26;
if(*(letter + tmp) == 0){
*(letter + tmp) = tmp + 'a';
i++;
}
}
}
int main(void)
{
char letter[26] = {0};
int i;
create(letter, 26);
for(i = 0; i < 26; i++)
printf("%c ", letter[i]);
putchar('\n');
return 0;
}
//用动态方法做
int id;
char *pname;
int score;
} *pstd;
输入5条学生信息,根据score进行升序排序
使用malloc函数或结构体数组
//定义结构体:struct student{
//int id;
//char *pname;
//int score;
//} *pstd;
//输入5条学生信息,根据score进行升序排序
//使用malloc函数或结构体数组
//
#include <stdio.h>
#include <stdlib.h>
typedef struct student{
int id;
char *pname;
int score;
}std_t;
std_t *get_info(std_t *pstd, int len)
{
int i;
pstd = (std_t *)malloc(len * sizeof(std_t));
if(pstd == NULL){
printf("malloc fail!\n");
exit(1);
}
for(i = 0; i < len; i++){
printf("enter %d info:\n", i + 1);
pstd[i].pname = (char *)malloc(20);
if(pstd[i].pname == NULL){
printf("malloc fail!\n");
exit(1);
}
scanf("%d %s %d", &pstd[i].id, pstd[i].pname, &pstd[i].score);
}
return pstd;
}
void sort(std_t *pstd, int len)
{
int i, j, pos;
std_t tmp;
for(i = 0; i < len - 1; i++){
pos = i;
for(j = i + 1; j < len; j++)
if(pstd[pos].score > pstd[j].score)
pos = j;
if(pos != i){
tmp = pstd[pos];
pstd[pos] = pstd[i];
pstd[i] = tmp;
}
}
}
void show_destroy(std_t *pstd, int len)
{
int i;
for(i = 0; i < len; i++){
printf("%d %s %d\n", pstd[i].id, pstd[i].pname, pstd[i].score);
free(pstd[i].pname);
}
free(pstd);
}
int main(void)
{
std_t *pstd = NULL;
pstd = get_info(pstd, 5);
sort(pstd, 5);
show_destroy(pstd, 5);
return 0;
}
//用数珠的方法
//定义结构体:struct student{
//int id;
//char *pname;
//int score;
//} *pstd;
//输入5条学生信息,根据score进行升序排序
//使用malloc函数或结构体数组
//
#include <stdio.h>
typedef struct student{
int id;
char *pname;
int score;
}std_t;
void get_info(std_t *pstd, char (*parr_name)[20], int row)
{
int i;
for(i = 0; i < row; i++){
printf("enter %d info:\n", i + 1);
pstd[i].pname = parr_name[i];
scanf("%d %s %d", &pstd[i].id, pstd[i].pname, &pstd[i].score);
}
}
void sort(std_t *pstd, int len)
{
int i, j, pos;
std_t tmp;
for(i = 0; i < len - 1; i++){
pos = i;
for(j = i + 1; j< len; j++)
if(pstd[pos].score > pstd[j].score)
pos = j;
if(pos != i){
tmp = pstd[pos];
pstd[pos] = pstd[i];
pstd[i] = tmp;
}
}
}
void bubble(std_t *pstd, int len)
{
int i, j;
std_t tmp;
for(i = 0; i < len - 1; i++){
for(j = 0; j < len - i - 1; j++)
if(pstd[j].score > pstd[j + 1].score){
tmp = pstd[j];
pstd[j] = pstd[j + 1];
pstd[j + 1] = tmp;
}
}
}
int main(void)
{
std_t std[5];
char name[5][20];
int i;
get_info(std, name, 5);
bubble(std, 5);
printf("after sort...\n");
for(i = 0; i < 5; i++)
printf("%d %s %d\n", std[i].id, std[i].pname, std[i].score);
return 0;
}
//定义一个字符指针数组如:
//char *str[] = {“Wuhan”,”Tianjin“, “Beijing“,
//“Shanghai”};按照字典序完成排序操作
//
#include <stdio.h>
#include <string.h>
int main(void)
{
char *str[] = {"Wuhan", "Tianjin", "Beijing", "Shanghai"};
char *tmp;
int i, j;
printf("*(*str + 0):%c\n", *(*str + 0));
printf("*(*str + 1):%c\n", *(*str + 1));
for(i = 0; i < 3; i++){
for(j = 0; j < 3 - i; j++)
if(strcmp(str[j], str[j + 1]) > 0){
tmp = str[j];
str[j] = str[j + 1];
str[j + 1] = tmp;
}
}
for(i = 0; i < 4; i++)
printf("%s\n", str[i]);
return 0;
}
//有字符串: ‚Today is a wonderful day!‛将该字
//符串中各个单词存放到二维数组:char str[5][10]
//
#include <stdio.h>
void parse(char *sp, char (*str)[10])
{
int i = 0, j = 0;
char *p = sp;
while(*p){
if(*p != ' '){
str[i][j++] = *p;
}else{
str[i++][j] = '\0';
j = 0;
}
p++;
}
str[i][j] = '\0';
}
int main(void)
{
char *sp = "Today is a wonderful day!";
char str[5][10];
int i;
parse(sp, str);
for(i = 0; i < 5; i++)
printf("%s\n", str[i]);
return 0;
}