Leet Code 53. Maximum Subarray

https://leetcode.com/problems/maximum-subarray/

Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

package pep.Day63;

public class LeetCode_53_Maximum_Subarray {
    public static void main(String[] args) {
        System.out.println(maxSubArray(new int[]{-1}));
    }

    public static int maxSubArray(int[] nums) {
        int ans = Integer.MIN_VALUE;
        int sum = 0;

        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];

            ans = Math.max(ans, sum);
            sum = sum < 0 ? 0 : sum;
        }

        return ans;
    }
}