[LintCode] Continuous Subarray Sum 连续子数组之和
2016-08-30 23:52
337 查看
Given an integer array, find a continuous subarray where the sum of numbers is the biggest. Your code should return the index of the first number and the index of the last number. (If their are duplicate answer, return anyone)
Have you met this question in a real interview?
Example
Give
这道题跟LeetCode上的那道Maximum Subarray很类似,不同之处在于这道题让返回最大子数组的范围坐标,而之前那道题只需要返回最大和即可,所以这道题我们要及时更新start和end变量,分别为子数组的起始和结束位置。我们用curSum来记录当前位置的累计和,如果某一个位置之前的累计和为负数,那么我们直接从当前位置开始重新算即可,因为加上负数还不如不加,此时将start和end都更新为当前位置i;如果之前的累计和大于等于0,那么我们把累计和curSum再加上当前的数字,然后更新end位置为i。此时我们更新最大子数组之和mx,以及res即可,参见代码如下:
类似题目:
Maximum Subarray
参考资料:
http://www.jiuzhang.com/solutions/continuous-subarray-sum/
Have you met this question in a real interview?
Example
Give
[-3, 1, 3, -3, 4], return
[1,4].
这道题跟LeetCode上的那道Maximum Subarray很类似,不同之处在于这道题让返回最大子数组的范围坐标,而之前那道题只需要返回最大和即可,所以这道题我们要及时更新start和end变量,分别为子数组的起始和结束位置。我们用curSum来记录当前位置的累计和,如果某一个位置之前的累计和为负数,那么我们直接从当前位置开始重新算即可,因为加上负数还不如不加,此时将start和end都更新为当前位置i;如果之前的累计和大于等于0,那么我们把累计和curSum再加上当前的数字,然后更新end位置为i。此时我们更新最大子数组之和mx,以及res即可,参见代码如下:
class Solution { public: /** * @param A an integer array * @return A list of integers includes the index of * the first number and the index of the last number */ vector<int> continuousSubarraySum(vector<int>& A) { vector<int> res(2, -1); int curSum = 0, mx = INT_MIN, start = 0, end = 0; for (int i = 0; i < A.size(); ++i) { if (curSum < 0) { curSum = A[i]; start = end = i; } else { curSum += A[i]; end = i; } if (mx < curSum) { mx = curSum; res[0] = start; res[1] = end; } } return res; } };
类似题目:
Maximum Subarray
参考资料:
http://www.jiuzhang.com/solutions/continuous-subarray-sum/
相关文章推荐
- lintcode 中等题:continuous subarray sum 连续子数组之和
- [LeetCode] Continuous Subarray Sum 连续的子数组之和
- [LintCode] Continuous Subarray Sum II
- [LintCode] Continuous Subarray Sum
- [Lintcode] Continuous Subarray Sum
- lintcode-Continuous Subarray Sum
- [Lintcode]Minimum Size Subarray Sum 和大于S的最小子数组
- [LintCode] Minimum Size Subarray Sum 最小子数组和的大小
- **[Lintcode]Subarray Sum Closest最接近零的子数组和
- LintCode 402: Continuous Subarray Sum
- LintCode : 最接近零的子数组和 Subarray Sum Closest
- [LintCode] Continuous Subarray Sum II
- 算法训练:Continuous Subarray Sum
- 523. Continuous Subarray Sum
- LeetCode - 523 - Continuous Subarray Sum
- hdoj Max Sum Plus Plus 1024 (DP) m个连续数组最大和
- Continuous Subarray Sum
- 41 - 找出数组中和为sum的 2个数字 | 找出和为sum的连续正整数序列
- 523. Continuous Subarray Sum
- [LintCode] Subarray Sum & Subarray Sum II