2022-12-26 Daily Challenge

Posted on:
Posted modified:
In: DailyChallenge

Today I have done leetcode's December LeetCoding Challenge with cpp.

December LeetCoding Challenge 26

Description

Jump Game

You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.

Return true if you can reach the last index, or false otherwise.

 

Example 1:

Input: nums = [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2:

Input: nums = [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.

 

Constraints:

  • 1 <= nums.length <= 104
  • 0 <= nums[i] <= 105

Solution

auto speedup = [](){
  cin.tie(nullptr);
  cout.tie(nullptr);
  ios::sync_with_stdio(false);
  return 0;
}();

class Solution {
public:
  bool canJump(vector<int>& nums) {
    int cur = 0;
    int len = nums.size();
    for(int i = 0; i < len && i <= cur; ++i) {
      cur = max(cur, i + nums[i]);
      if(cur >= len - 1) return true;
    }
    return false;
  }
};

// Accepted
// 170/170 cases passed (56 ms)
// Your runtime beats 98.71 % of cpp submissions
// Your memory usage beats 79.88 % of cpp submissions (48.3 MB)
Algorithm