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. 采用动态规划的思想：
int maxSubArray(vector<int>& nums) { int len = nums.size(); int dp[len]; dp[0] = nums[0]; int maxNum = nums[0]; for(int i = 1; i < len; i++){ dp[i] = max(dp[i-1]+nums[i],nums[i]); maxNum = max(dp[i],maxNum); } return maxNum; }新闻热点
疑难解答
