回答編集履歴
2
訂正
test
CHANGED
|
@@ -20,9 +20,9 @@
|
|
|
20
20
|
|
|
21
21
|
stack.push(no);
|
|
22
22
|
|
|
23
|
-
xStack.push(
|
|
23
|
+
xStack.push(x);
|
|
24
24
|
|
|
25
|
-
yStack.push(
|
|
25
|
+
yStack.push(y);
|
|
26
26
|
|
|
27
27
|
while(!stack.isEmpty()){
|
|
28
28
|
|
1
訂正改良
test
CHANGED
|
@@ -1,4 +1,6 @@
|
|
|
1
1
|
```java
|
|
2
|
+
|
|
3
|
+
|
|
2
4
|
|
|
3
5
|
import java.util.ArrayDeque;
|
|
4
6
|
|
|
@@ -22,7 +24,7 @@
|
|
|
22
24
|
|
|
23
25
|
yStack.push(3);
|
|
24
26
|
|
|
25
|
-
while(t
|
|
27
|
+
while(!stack.isEmpty()){
|
|
26
28
|
|
|
27
29
|
if(no > 1){
|
|
28
30
|
|
|
@@ -38,7 +40,7 @@
|
|
|
38
40
|
|
|
39
41
|
}
|
|
40
42
|
|
|
41
|
-
if(stack.isEmpty()
|
|
43
|
+
if(!stack.isEmpty()){
|
|
42
44
|
|
|
43
45
|
no = stack.pop();
|
|
44
46
|
|
|
@@ -84,4 +86,6 @@
|
|
|
84
86
|
|
|
85
87
|
}
|
|
86
88
|
|
|
89
|
+
|
|
90
|
+
|
|
87
91
|
```
|