Skip to content

Instantly share code, notes, and snippets.

@fpdjsns
Last active November 4, 2018 12:29
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
Star You must be signed in to star a gist
Save fpdjsns/157788123006e2e518e352129645b170 to your computer and use it in GitHub Desktop.
[leetcode] 53. Maximum Subarray : https://leetcode.com/problems/maximum-subarray/
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int ans = nums[0];
int subSum = 0;
for(int i=0;i<nums.size();i++){
subSum += nums[i];
ans = max(subSum, ans);
if(subSum < 0)
subSum = 0;
}
return ans;
}
};
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment