53. Maximum Subarray 最大子数组
Given an integer array nums
, find the subarray with the largest sum, and return its sum.
给定一个整数数组 nums,找到具有最大和的子数组,并返回其总和。
class Solution {
public:
int maxSubArray(vector<int>& nums) {
if(nums.size()==0) return NULL;
int res=INT_MIN;
int f_n=-1;
for(int i=0; i<nums.size(); ++i){
f_n = max(nums[i], f_n+nums[i]);
res=max(f_n, res);
}
return res;
}
};