回答編集履歴
1
)が不足 コメント指摘より
answer
CHANGED
|
@@ -16,7 +16,7 @@
|
|
|
16
16
|
Deque<Point> pointStack = new ArrayDeque<>();
|
|
17
17
|
pointStack.addFirst(new Point(is, js);
|
|
18
18
|
Point p;
|
|
19
|
-
while ((p = pointStack.pollFirst() != null) {
|
|
19
|
+
while ((p = pointStack.pollFirst()) != null) {
|
|
20
20
|
if(p.i<0 || p.i>=rownum_s || p.j<0 || p.j>=colnum_s){
|
|
21
21
|
continue;
|
|
22
22
|
}
|