代码改变世界

leetcode - Maximum Subarray

2013-04-28 19:29  张汉生  阅读(146)  评论(0)  编辑  收藏  举报

题目描述：点击此处

经典的字段和问题

 1 class Solution {
 2 public:
 3   int maxSubArray(int A[], int n) {
 4     // Start typing your C/C++ solution below
 5     // DO NOT write int main() function
 6     if (n<=0)
 7       return 0;
 8     int maxSum = -2000000000;
 9     int b = maxSum, i;
10     for (i=0; i<n; i++){
11       if (b<0)
12         b = A[i];
13       else b += A[i];
14       if (b>maxSum)
15         maxSum = b;
16     }
17     return maxSum;
18   }
19 };