lintcode:Continuous Subarray Sum

最新推荐文章于 2024-12-26 21:26:13 发布

原创最新推荐文章于 2024-12-26 21:26:13 发布 · 1.4k 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

lintcode

66 篇文章

订阅专栏

本文介绍了一种寻找整数数组中最大连续子数组的方法，并通过示例[-3,1,3,-3,4]展示了如何返回该子数组的起始和结束索引。文章还提供了一个C++实现的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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?

Yes

Example

Give [-3, 1, 3, -3, 4], return [1,4].

Tags Expand

Related Problems Expand

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) {
        // Write your code here
        vector<int> res;
        
        if (A.size() == 0)
            return res;
        
        int curLeft  = 0;
        
        int maxLeft  = curLeft;
        int maxRight = 0;
        
        int curSum = 0;
        int maxSum = INT_MIN;
        
        for (int i=0; i<A.size(); i++)
        {
            curSum += A[i];
            
            if (curSum > maxSum)
            {
                maxLeft  = curLeft;
                maxRight = i;
                maxSum = curSum;
            }
            
            if (curSum < 0)
            {
                if (i+1 <= A.size()-1)
                {
                    curSum = 0;
                    curLeft  = i+1;
                }
            }
        }

        res.push_back(maxLeft);
        res.push_back(maxRight);
        
        return res;
    }
};