贪心算法之最大子数组和（三）

解法一：暴力（leetcode超时） 

class Solution {
public:int maxSubArray(vector<int>& nums) {int result = INT32_MIN;int count = 0;for (int i = 0; i < nums.size(); i++) {count = 0;for (int j = i; j < nums.size(); j++) {count += nums[j];result = count > result ? count : result;}}return result;}
};

解法二：贪心

class Solution {
public:int maxSubArray(vector<int>& nums) {int res=INT32_MIN;int a=0;for(int i=0;i<nums.size();i++){a+=nums[i];if(a>res){res=a;}if(a<=0)a=0;}return res;}
};