vector<int> subarraySum(vector<int> nums){
        // write your code here
        unordered_map<int,int> sumInd;
        sumInd[0] = 0;
        int curSum = 0;
        vector<int> result;
        for (int i = 0; i < nums.size(); i++)
        {
            curSum += nums[i];
            if (sumInd.find(curSum) != sumInd.end())
            {
                result.push_back(sumInd[curSum]);
                result.push_back(i);
                break;
            }
            else
                sumInd[curSum] = i + 1;
        }
        return result;
    }

    vector<int> subarraySum(vector<int> nums){
        // write your code here
        vector<int> result;
        if (nums.empty())
            return result;
        int numSum = nums.size();
        vector<pair<int, int> > sum_index(numSum + 1); //和-下标对;
        int lastSum = 0;
        //先统计sum和index键值对;
        for (int i = 0; i < numSum; i++)
        {
            lastSum = lastSum + nums[i];
            sum_index[i+1].first  = lastSum;
            sum_index[i+1].second = i + 1;
        }
        //接下来排序然后看看相邻的两个是否一样;
        sort(sum_index.begin(), sum_index.end());
        for (int i = 1; i < numSum + 1; i ++)
            if (sum_index[i].first == sum_index[i - 1].first)
            {
                result.push_back(sum_index[i - 1].second);
                result.push_back(sum_index[i].second - 1);
                break;
            }
        return result;
    }