【Medium】402. Continuous Subarray Sum

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)

Example:

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

解题思路

与041. Maximum Subarray完全一致，只是需要保存最小值对应的数组下标。

时间空间复杂度

O(n) + S(1)

n为数组长度