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
        int ans = INT_MIN, pre = 0, curr = 0;
        for(int i = 0; i < n; i++){
            curr = pre > 0 ? pre + A[i] : A[i];
            pre = curr;
            ans = max(ans,curr); 
        }
        return ans;
    }
};

原文链接: https://www.cnblogs.com/kwill/p/3188028.html

欢迎关注

微信关注下方公众号，第一时间获取干货硬货；公众号内回复【pdf】免费获取数百本计算机经典书籍