blob: 874fd06dc31eebd0cf2256d7f00e42b74b77a50e (
plain)
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
|
//sample function of Serpentine filling
int t = 1;
int a[15][15];
int main() {
int n, i, j;
n = 4;
i = 1;
j = 1;//初始位置
while (t <= n * n) {//没有遍历完继续
while (1) {//向右上走
if (i<1 || j>n) {//不出界
i = i + 1;
j = j - 1;
break;
}
else {
a[i][j] = t;
t = t + 1;
i = i - 1;
j = j + 1;
}
}
if (j == n) {
i = i + 1;
}
else{
if (i == 1){
j = j + 1;
}
}
while (1) {//向左下走
if (i > n || j < 1) {//不出界
j = j + 1;
i = i - 1;
break;
}
else {
a[i][j] = t;
t = t + 1;
i = i + 1;
j = j - 1;
}
}
if (i == n){
j = j + 1;
}
else{
if (j == 1){
i = i + 1;
}
}
}
i = 1;
while(i <= n){
j = 1;
while(j <= n){
putint(a[i][j]);
j = j + 1;
}
i = i + 1;
}
return 0;
}
|
