diff options
author | Jack Sangdahl <[email protected]> | 2025-01-29 11:46:16 -0700 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-01-29 11:46:16 -0700 |
commit | 2de9d2dce0fd4de524961ad5188a95410f4432c2 (patch) | |
tree | 0da068bf95592f39f2dd4f135b0e73b689df27d0 /min_jump_reach_home.cpp | |
parent | ad25ada54a68851b935f52f9d1bc4ec969583205 (diff) | |
download | leetcode-2de9d2dce0fd4de524961ad5188a95410f4432c2.tar.gz leetcode-2de9d2dce0fd4de524961ad5188a95410f4432c2.zip |
chore: Fix vvd usages
Diffstat (limited to 'min_jump_reach_home.cpp')
-rw-r--r-- | min_jump_reach_home.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/min_jump_reach_home.cpp b/min_jump_reach_home.cpp index 4a66f27..7510c8c 100644 --- a/min_jump_reach_home.cpp +++ b/min_jump_reach_home.cpp @@ -4,7 +4,7 @@ class Solution { public: int minimumJumps(vector<int> &forbidden, int a, int b, int x) { unordered_set<int> f(forbidden.begin(), forbidden.end()); - vvd(int) visited(2, vector<int>(5000)); + vvd visited(2, vector<int>(5000)); queue<pair<int, bool>> qp; qp.push({0, false}); visited[0][0] = 1; |