53. Maximum Subarray

---

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.

//（1）暴力枚举
// class Solution {
// public:
//     int maxSubArray(vector<int>& nums) {
//         int n = nums.size();
//         int ans = nums[0];
//         for(int i=0;i<n;i++)
//             for(int j=i;j<n;j++){
//                 int sum = 0;
//                 for(int k=i;k<=j;k++)
//                     sum +=nums[k];
//                  if(ans<=sum)
//                      ans = sum;
//             }
//         return ans;
//     }
// };
//-------------------------------------------------------------------------结果：Time Limit Exceeded
//（2）优化枚举
// class Solution {
// public:
//     int maxSubArray(vector<int>& nums) {
//         int n = nums.size();
//         int ans = nums[0];
//         for(int i=0;i<n;i++)
//         {                               //一定要加括号
//             int sum = 0;
//             for(int j=i;j<n;j++){
//                     sum +=nums[j];
//                  if(ans<=sum)
//                      ans = sum;
//             } 
//         }     
//         return ans;
//     }
// };
//-------------------------------------------------------------------------结果：Accepted
//(3)贪心算法
class Solution{
public:
    int maxSubArray(vector<int>& nums){
        int sum = 0;
        int ans = nums[0];
        int n = nums.size();
        for(int i = 0;i<n;i++){
            sum +=nums[i];
            if(ans<sum)
                ans = sum;
            if(sum<0)
                sum = 0;
        }
        return ans;
    }
};                                                 //这里不是}  而是};   666
//-------------------------------------------------------------------------结果：Accepted