LintCode_chapter2_section2_subarray-sum

coding = utf-8

'''
Created on 2015年11月6日

@author: SphinxW
'''
# 子数组之和
#
# 给定一个整数数组，找到和为零的子数组。你的代码应该返回满足要求的子数组的起始位置和结束位置
# 样例
#
# 给出[-3, 1, 2, -3, 4]，返回[0, 2] 或者 [1, 3].


class Solution:
    """
    @param nums: A list of integers
    @return: A list of integers includes the index of the first number 
             and the index of the last number
    """

    def subarraySum(self, nums):
        # write your code here
        for head in range(len(nums)):
            sum = nums[head]
            if sum == 0:
                return [head, head]
            for next in range(head + 1, len(nums)):
                sum += nums[next]
                if sum == 0:
                    return [head, next]