Skip to content

3282. Reach End of Array With Max Score 👍

  • Time: $O(n)$
  • Space: $O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
class Solution {
 public:
  // Similar to 3205. Maximum Array Hopping Score I
  long long findMaximumScore(vector<int>& nums) {
    // The optimal jump is the nearest index j > i s.t. nums[j] > nums[i].
    long ans = 0;
    int mx = 0;

    for (const int num : nums) {
      ans += mx;
      mx = max(mx, num);
    }

    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
class Solution {
  // Similar to 3205. Maximum Array Hopping Score I
  public long findMaximumScore(List<Integer> nums) {
    // The optimal jump is the nearest index j > i s.t. nums[j] > nums[i].
    long ans = 0;
    int mx = 0;

    for (final int num : nums) {
      ans += mx;
      mx = Math.max(mx, num);
    }

    return ans;
  }
}

1
2
3
4
class Solution:
  # Similar to 3205. Maximum Array Hopping Score I
  def findMaximumScore(self, nums: list[int]) -> int:
    return sum(itertools.accumulate(nums[:-1], max))