Continuous Subarray Sum

Problem

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].

Solution

The trick is that once the sum is negative, it can start over by setting sum to 0.