| 试题一 |
试题二 |
| (1) 3 |
(1) s1++ |
| (2) 4 |
(2) *s1= *s2 |
| (3) 1111 |
(3) n<=0 ? ? n>=MAXLINE |
| (4) 或(加) |
(4) a[i] > a[*index] |
| (5) 与(乘) |
(5) a[*index] |
|
|
| 试题三 |
试题四 |
| (1) i-1 |
(1) sieve[i] = 1 |
| (2) a[j+1] = a[j] |
(2) sieve[factor] == 1 或
sieve[factor] > 0 或 sieve[factor] >= 0 或 sieve[factor] != -1 |
| (3) a[j+1] = t |
(3) sieve[k] = -1 |
| (4) k > 1 |
(4) k+factor |
| (5) a+1 , k-2 |
(5) factor++ |
|
|
| 试题五 |
|
| (1) &((*tree) -> left) |
|
| (2) &((*tree) -> right) |
(4)tag[top] == 1 或 tag[top] 或 tag[top] != 0 |
| (3) p = p -> left 或 p = stack[top] -> left |
(5) p = stack[ top ] -> right |