Java实现-子数组之和

给定一个整数数组，找到和为零的子数组。你的代码应该返回满足要求的子数组的起始位置和结束位置

 注意事项

There is at least one subarray that it's sum equals to zero.

您在真实的面试中是否遇到过这个题？ 

Yes

样例

给出 [-3, 1, 2, -3, 4]，返回[0, 2] 或者 [1, 3].

public 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
     */
    public ArrayList<Integer> subarraySum(int[] nums) {
        // write your code here
        ArrayList<Integer> list=new ArrayList<Integer>();
		if(nums==null||nums.length==0){
			return list;
		}
		for(int i=0;i<nums.length;i++){
			int sum=nums[i];
			if(sum==0){
				list.add(i);
				list.add(i);
				return list;
			}else{
				list.add(i);
			}
			for(int j=i+1;j<nums.length;j++){
				sum+=nums[j];
				if(sum==0){
					list.add(j);
					return list;
				}
			}
			list.clear();
		}
		return list;
    }
}