leetcode 53. Maximum Subarray

Seawolf

1. Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
   
2. 
   
3. Example:
   
4. 
   
5. Input: [-2,1,-3,4,-1,2,1,-5,4],
   
6. Output: 6
   
7. Explanation: [4,-1,2,1] has the largest sum = 6.
   
8. Follow up:
   
9. 
   
10. If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

复制代码

1. class Solution {
   
2.     public int maxSubArray(int[] nums) {
   
3.         
   
4.         if(nums.length == 0) return 0;
   
5.         
   
6.         int sum = 0;
   
7.         int Max = nums[0];
   
8.         
   
9.         int len = nums.length;
   
10.         
    
11.         for(int i = 0 ; i < len ; i++){
    
12.         
    
13.             sum = sum + nums[i];
    
14.             
    
15.             Max = Math.max(Max, sum);
    
16.         
    
17.             if(sum + nums[i]< nums[i]){
    
18.                 sum = 0;
    
19.             }
    
20.         }
    
21.         
    
22.         return Max;
    
23.         
    
24.     }
    
25. }

复制代码