首页 > 代码库 > 53. Maximum Subarray
53. 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.
1 class Solution { 2 public: 3 int maxSubArray(vector<int>& nums) { 4 if(nums.size() == 0){ 5 return 0; 6 } 7 8 int sum = 0; 9 int greatSum = INT_MIN;10 11 for(int i = 0; i < nums.size() ; i++){12 sum += nums[i];13 greatSum = max(greatSum, sum);14 if(sum < 0){15 sum = 0;16 }17 }18 return greatSum;19 }20 };
53. Maximum Subarray
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。