[LeetCode]53.Maximum Subarray

标签：leetcode   数组   

【题目】

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.

click to show more practice.

【分析】

无

【代码】

/*********************************
*   日期：2015-01-27
*   作者：SJF0115
*   题目: 53.Maximum Subarray
*   网址：https://oj.leetcode.com/problems/maximum-subarray/
*   结果：AC
*   来源：LeetCode
*   博客：
**********************************/
#include <iostream>
#include <climits>
using namespace std;

class Solution {
public:
    int maxSubArray(int A[], int n) {
        if(n <= 0){
            return 0;
        }//if
        // 最大和
        int max = A[0];
        // 当前最大和
        int cur = 0;
        for(int i = 0;i < n;++i){
            // 一旦当前最大和小于0就重置为0,一个负数只能使最大和变小
            if(cur < 0){
                cur = 0;
            }//if
            cur += A[i];
            if(cur > max){
                max = cur;
            }//if
        }//for
        return max;
    }
};
int main(){
    Solution solution;
    int n = 9;
    int A[] = {-2,1,-3,4,-1,2,1,-5,4};
    int result = solution.maxSubArray(A,n);
    // 输出
    cout<<result<<endl;
    return 0;
}

[LeetCode]53.Maximum Subarray

标签：leetcode   数组   

原文地址：http://blog.csdn.net/sunnyyoona/article/details/43200983