【题目】
Given an integer array nums
, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6.
Follow up:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
【思路】
Kadane's Algorithm 位置的移动通过判断cur正负,为负置0。
leetcode121 best time buy and sell
https://blog.csdn.net/sinat_34976604/article/details/80970936
【代码】
class Solution {
public int maxSubArray(int[] nums) {
int sum=Integer.MIN_VALUE;
int cur=0;
for(int i=0;i<nums.length;i++){
cur+=nums[i];
sum=Math.max(sum,cur);
cur=cur<0?0:cur;
}
return sum;
}
}