|
1
2
3
4
5
6
7
8
9
10
11
12
13
14 |
cpp] view plaincopyprint? class
Solution { public: int
maxSubArray(int
A[], int
n) { // Start typing your C/C++ solution below // DO NOT write int main() function int
sum = A[0], max = A[0]; for
(int i = 1; i < n; i++) { sum = sum < 0 ? A[i] : sum + A[i]; max = sum > max ? sum : max; } return
max; } }; |
原文：http://www.cnblogs.com/hjdx/p/3545642.html