动态规划相关算法题

相关题目

LintCode: 53. 最大子序和

LintCode: 53. 最大子序和

该题目的动态规划原理

Java

class Solution {
    public int maxSubArray(int[] nums) {
        if (nums == null || nums.length <= 0) return -1;
        
        int result = 0;
        int max = Integer.MIN_VALUE;
        for (int i = 0; i < nums.length; i++) {
            if (result <= 0) {
                result = nums[i];
            } else {
                result = result + nums[i];
            }
            
            if (result > max) {
                max = result;
            }
        }
        
        return max;
    }
}

Go