LeetCode Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

UPDATE (2016/2/13):

The return format had been changed to zero-based indices. Please read the above updated description carefully.

方法一：

存到一个hash表中，判断target-nums[i]是否在表中。

时间和空间复杂度都是O(N)

[cpp] view plain copy

print ?

1. class Solution {  
2. public:  
3.     vector<int> twoSum(vector<int>& nums, int target) {  
4.         vector<int> res;  
5.         int len = nums.size();  
6.         unordered_map<int,int> m;  
7.         for (int i = 0; i < len; i++){  
8.             if (m.count(target - nums[i])){  
9.                 res.push_back(i);  
10.                 res.push_back(m[target - nums[i]]);  
11.                 return res;  
12.             }  
13.             m[nums[i]] = i;  
14.         }  
15.         return res;  
16.     }  
17. };  

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> res;
        int len = nums.size();
        unordered_map<int,int> m;
        for (int i = 0; i < len; i++){
            if (m.count(target - nums[i])){
                res.push_back(i);
                res.push_back(m[target - nums[i]]);
                return res;
            }
            m[nums[i]] = i;
        }
        return res;
    }
};

方法二

先排序，在用 双指针夹逼求出两个值。

注意需要记录原来的索引

[cpp] view plain copy

print ?

1. class Solution {  
2. public:  
3.   
4.     struct cmp{  
5.         bool operator()(const pair<int,int>&a,const pair<int,int>&b)const{  
6.             return a.first < b.first;  
7.         }  
8.     };  
9.   
10.     vector<int> twoSum(vector<int>& nums, int target) {  
11.         vector<pair<int, int> >newNums;  
12.         for (int i = 0; i < nums.size(); i++){  
13.             newNums.push_back({ nums[i], i });  
14.         }  
15.         sort(newNums.begin(), newNums.end());  
16.         vector<int> res;  
17.         int pa = 0, pb = newNums.size() - 1;  
18.         while (pa < pb){  
19.             if (newNums[pa].first + newNums[pb].first == target){  
20.                 res.push_back(newNums[pa].second);  
21.                 res.push_back(newNums[pb].second);  
22.                 return res;  
23.             }  
24.             else if (newNums[pa].first + newNums[pb].first < target){  
25.                 pa++;  
26.             }  
27.             else{  
28.                 pb–;  
29.             }  
30.         }  
31.         return res;  
32.     }  
33. };  

class Solution { 

public:

struct cmp{
    bool operator()(const pair<int,int>&a,const pair<int,int>&b)const{
        return a.first < b.first;
    }
};

vector<int> twoSum(vector<int>& nums, int target) {
    vector<pair<int, int> >newNums;
    for (int i = 0; i < nums.size(); i++){
        newNums.push_back({ nums[i], i });
    }
    sort(newNums.begin(), newNums.end());
    vector<int> res;
    int pa = 0, pb = newNums.size() - 1;
    while (pa < pb){
        if (newNums[pa].first + newNums[pb].first == target){
            res.push_back(newNums[pa].second);
            res.push_back(newNums[pb].second);
            return res;
        }
        else if (newNums[pa].first + newNums[pb].first < target){
            pa++;
        }
        else{
            pb--;
        }
    }
    return res;
}


};