package array;
/**
* [53] 最大ååºå’Œ
* @author: Aghao
*
* Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
*
* 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.
*
* 动æ€è§„划法
* 时间å¤æ‚度：O(n)
* 空间å¤æ‚度：O(1)
*
* 暴力é历法
* 时间å¤æ‚度：O(n*n)
* 空间å¤æ‚度：O(1)
*/
public class MaxSubArray {
public static void main(String[] args) {
int[] nums = {-2,1,-3,4,-1,2,1,-5,4};
// int result = new MaxSubArray().maxSubArrayViolence(nums);
int result = new MaxSubArray().maxSubArray(nums);
System.out.println(result);
}
// 动æ€è§„划法
// å‰ååºåˆ—和如果å°äºŽ0，就èˆå¼ƒ
private int maxSubArray(int[] nums) {
int pre = 0;
int maxRes = nums[0];
for(int i:nums) {
pre = Math.max(pre + i, i);
maxRes = Math.max(pre, maxRes);
}
return maxRes;
}
// 暴力法
private int maxSubArrayViolence(int[] nums) {
int maxRes = nums[0];
for(int i=0;i