LintCode
Subarray Sum
LintCode-138.Subarray Sum Given an integer array, find a subarray where the sum of numbers is zero. Your code should return the index of the first number and the index of the last number. Notice: There is at least one subarray that it's sum equals to zero. Have