diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/jump_game6.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/jump_game6.cpp')
-rw-r--r-- | other/jump_game6.cpp | 26 |
1 files changed, 0 insertions, 26 deletions
diff --git a/other/jump_game6.cpp b/other/jump_game6.cpp deleted file mode 100644 index 81bbf05..0000000 --- a/other/jump_game6.cpp +++ /dev/null @@ -1,26 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int maxResult(vector<int> &nums, int k) { - int ans = 0; - deque<int> dq; - for (int i = nums.size() - 1; i >= 0; i--) { - ans = nums[i] + (dq.empty() ? 0 : nums[dq.front()]); - while (!dq.empty() && ans > nums[dq.back()]) - dq.pop_back(); - dq.push_back(i); - if (dq.front() >= i + k) - dq.pop_front(); - nums[i] = ans; - } - return ans; - } -}; - -int main() { - Solution obj; - vector<int> nums = {1, -1, -2, 4, -7, 3}; - int k = 2; - cout << obj.maxResult(nums, k); -} |