LeetCode: Maximum Subarray

自己想得太复杂了，网上查了别人的代码。。太简单了。。

class Solution {
public:
    int maxSubArray(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int sum = 0;
        int ret = INT_MIN;
        for(int i = 0 ; i < n; ++i) {
            sum += A[i];
            ret = max(ret, sum);
            sum = max(sum, 0);
        }
        return ret;
    }
};

 C#

public class Solution {
    public int MaxSubArray(int[] nums) {
        int sum = 0;
        int ans = Int32.MinValue;
        for (int i = 0; i < nums.Length; i++) {
            sum += nums[i];
            ans = Math.Max(ans, sum);
            sum = Math.Max(sum, 0);
        }
        return ans;
    }
}