leetcode：一道清华考研专业课算法题

贪心算法：

class Solution {
    public int maxSubArray(int[] nums) {
        int Ret = nums[0],sum =0;
        for(int i =0;i<nums.length;i++){
            sum+=nums[i];
            Ret = Ret>sum?Ret:sum;
            if(sum<0) sum = 0;
        }
        return Ret;
    }
}

动态规划：

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

        return result;
    }
}