From a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Fri, 27 Jun 2025 12:23:02 -0600 Subject: chore: remove old cpp and rust solutions --- other/min_jump_reach_home.cpp | 44 ------------------------------------------- 1 file changed, 44 deletions(-) delete mode 100644 other/min_jump_reach_home.cpp (limited to 'other/min_jump_reach_home.cpp') diff --git a/other/min_jump_reach_home.cpp b/other/min_jump_reach_home.cpp deleted file mode 100644 index 7510c8c..0000000 --- a/other/min_jump_reach_home.cpp +++ /dev/null @@ -1,44 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int minimumJumps(vector &forbidden, int a, int b, int x) { - unordered_set f(forbidden.begin(), forbidden.end()); - vvd visited(2, vector(5000)); - queue> qp; - qp.push({0, false}); - visited[0][0] = 1; - visited[1][0] = 1; - int ans = 0; - while (!qp.empty()) { - int len = qp.size(); - while (len > 0) { - len--; - int curr = qp.front().first; - bool flag = qp.front().second; - if (curr == x) - return ans; - qp.pop(); - int forward = curr + a, backward = curr - b; - if (forward < 5000 && visited[0][forward] == 0 && !f.count(forward)) { - qp.push({forward, false}); - visited[0][forward] = 1; - } - if (backward >= 0 && visited[1][backward] == 0 && !f.count(backward) && - !flag) { - qp.push({backward, true}); - visited[1][backward] = 1; - } - } - ans++; - } - return ans; - } -}; - -int main() { - Solution obj; - vector forbidden = {14, 4, 18, 1, 15}; - int a = 3, b = 15, x = 9; - cout << obj.minimumJumps(forbidden, a, b, x); -} -- cgit v1.2.3