Greedy

Blind 75

Maximum Subarray

Question

Drawing Explanation

Code

class Solution {
    public int maxSubArray(int[] nums) {
        if(nums.length == 1) return nums[0];
        
        int sum = 0;
        int max = Integer.MIN_VALUE;
        
        for(int n : nums){
            sum += n;
            max = Math.max(max, sum);
            
            if(sum < 0){
                sum = 0;
            }
        }
        return max;
    }
}ja

Jump Game

Question

Drawing Explanation

Code