最大子序和
解法一:动态规划
public class LeetCode_053 {
public static int maxSubArray(int[] nums) {
int max = nums[0], sum = nums[0];
for (int i = 1; i < nums.length; i++) {
if (sum <= 0) {
sum = nums[i];
} else {
sum = sum + nums[i];
}
max = Math.max(max, sum);
}
return max;
}
public static void main(String[] args) {
int[] nums = new int[]{-2, 1, -3, 4, -1, 2, 1, -5, 4};
System.out.println(maxSubArray(nums));
}
}