***(leetcode) 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) {        int max = A[0] , tmp = 0; // max 有可能为负，so max初值为第一个元素。        for(int i = 0 ; i < n ; i++){            tmp+=A[i];            max = max>tmp?max:tmp;            if(tmp<0)                tmp = 0;        }        return max;    }    };