leetcode [#53]

目录

• 1. 题目
• 2. 解决方案
• 3. 注意事项

题目

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

Example
given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray [4,-1,2,1] has the largest sum = 6.

---

解决方案

public class Solution {
    public int maxSubArray(int[] nums) {
        int maxSoFar = nums[0];
        int maxEndingHere = nums[0];
        for (int i = 1; i < nums.length; i++){
            maxEndingHere = Math.max(maxEndingHere + nums[i], nums[i]);
            maxSoFar = Math.max(maxSoFar, maxEndingHere);   
        }
        return maxSoFar;
    }
}

---

注意事项

1. 典型的动态规划问题。
2. 思路：