Update minimum-time-takes-to-reach-destination-without-drowning.cpp

kamyu104 · web-flow · commit 739e0834b20d · 2023-08-10T23:06:11.000+08:00
diff --git a/C++/minimum-time-takes-to-reach-destination-without-drowning.cpp b/C++/minimum-time-takes-to-reach-destination-without-drowning.cpp
@@ -19,12 +19,13 @@ class Solution {
                 }
             }
         }
-        q.emplace_back(i0, j0, 0);
+        q.emplace_back(i0, j0, 1);
+        lookup[i0][j0] = 1;
         while (!empty(q)) {
             vector<tuple<int, int, int>> new_q;
             for (const auto& [i, j, d] : q) {
                 if (land[i][j] == "D") {
-                    return d;
+                    return d - 1;
                 }
                 for (const auto& [di, dj] : DIRECTIONS) {
                     const int ni = i + di, nj = j + dj;

Original file line number	Diff line number	Diff line change
`@@ -19,12 +19,13 @@ class Solution {`
`19`	`19`	`}`
`20`	`20`	`}`
`21`	`21`	`}`
`22`		`- q.emplace_back(i0, j0, 0);`
	`22`	`+ q.emplace_back(i0, j0, 1);`
	`23`	`+ lookup[i0][j0] = 1;`
`23`	`24`	`while (!empty(q)) {`
`24`	`25`	`vector<tuple<int, int, int>> new_q;`
`25`	`26`	`for (const auto& [i, j, d] : q) {`
`26`	`27`	`if (land[i][j] == "D") {`
`27`		`- return d;`
	`28`	`+ return d - 1;`
`28`	`29`	`}`
`29`	`30`	`for (const auto& [di, dj] : DIRECTIONS) {`
`30`	`31`	`const int ni = i + di, nj = j + dj;`