We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 2318bd8 commit 61d40a9Copy full SHA for 61d40a9
1 file changed
13/8.cpp
@@ -89,15 +89,15 @@ int solution(vector<vector<int> > board) {
89
Node pos = nextPos[i];
90
for (int j = 0; j < visited.size(); j++) {
91
if (pos.pos1X == visited[j].pos1X && pos.pos1Y == visited[j].pos1Y && pos.pos2X == visited[j].pos2X && pos.pos2Y == visited[j].pos2Y) {
92
- check = false;
93
- break;
94
- }
+ check = false;
+ break;
+ }
95
}
96
if (check) {
97
- q.push({pos, cost + 1});
98
- visited.push_back(pos);
99
+ q.push({pos, cost + 1});
+ visited.push_back(pos);
100
101
102
return 0;
103
-}
+}
0 commit comments