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.

看《剑指offer》看到这道题，过来刷一下···

class Solution {
public:int maxSubArray(vector<int>& nums) {int cursum=0;int greatestsum=0x80000000;     //可以表示的最大的负数for(int i=0;i<nums.size();i++){if(cursum<=0)              //如果cursum为负，如果算上cursum会小于不算cursum开始的子数组的和，因此不需要前面的子数组，cursum扔掉cursum=nums[i];else cursum+=nums[i];if(cursum>greatestsum)greatestsum=cursum;}return greatestsum;}
};

转载于:https://www.cnblogs.com/LUO77/p/5328182.html

53. Maximum Subarray相关推荐

[Lintcode]41. Maximum Subarray/[Leetcode]53. Maximum Subarray
41. Maximum Subarray/53. Maximum Subarray 本题难度: Eas Topic: Dynamic Programming Description Given an ...
53.Maximum Subarray
/** 53.Maximum Subarray * 2016-5-7 by Mingyang * 如果我们从头遍历这个数组.对于数组中的其中一个元素,它只有两个选择: 1.* 要么加入之前的数组加和之 ...
【DP】LeetCode 53. Maximum Subarray
LeetCode 53. Maximum Subarray Solution1:我的答案动态规划 class Solution { public:int maxSubArray(vector< ...
【动态规划】LeetCode 53. Maximum Subarray
LeetCode 53. Maximum Subarray 原题描述(求子序列最大和/最大子串):Find the contiguous subarray within an array (conta ...
LeetCode(53):Maximum Subarray
Maximum Subarray: Find the contiguous subarray within an array (containing at least one number) whic ...
[LeetCode]: 53: Maximum Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
重做53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
leetCode 53. maximum subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
LeetCode#53 Maximum Subarray
Problem Difinition: Find the contiguous subarray within an array (containing at least one number) wh ...

53. Maximum Subarray

53. Maximum Subarray相关推荐

最新文章

热门文章