int maxSubArray(vector<int>& nums) { int maxSum = nums[0], currSum = nums[0]; for(int i=1; i < nums.size(); i++) { currSum += nums[i]; if(nums[i] > currSum) currSum = nums[i]; maxSum = (currSum > maxSum) ? currSum : maxSum; } return maxSum; }
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter