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)
Give [-3, 1, 3, -3, 4], return [1,4].
[LintCode] Continuous Subarray Sum 连续子数组之和
原文：http://www.cnblogs.com/grandyang/p/5824192.html