[leetcode.com]算法题目 - Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray [4,−1,2,1] has the largest sum = 6.

 class Solution {
 public:
     int maxSubArray(int A[], int n) {
         // Start typing your C/C++ solution below
         // DO NOT write int main() function
         if (>=n) return ;

         int b = ;

         int sum =A[];

         for(int i=;i<n;i++){
             if(b<)
                 b=;

             b = b+A[i];

             if(b>sum)
                 sum =b;
         }
         return sum;
     }
 };

我的答案

思路：最大连续子数组的和，这是个非常经典的题目，答案也很简练，重点是代码中b这个变量的使用。