子数组之和为零 lintcode

[-3,
1, 2, -3, 4]

[0, 2]

[1,
3]

class Solution {
public:
/**
* @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
*/
vector<int> subarraySum(vector<int> nums){
// write your code here
vector<int> result;
int n = nums.size();
int sum = 0;
for(int i = 0;i<n;i++){
for(int j = i;j<n;j++)
{

sum += nums[j];
if(sum == 0)
{
result.push_back(i);
result.push_back(j);
return result;
}

}
}
//return result;
}
};