lc1-Two Sum

發表於   |   分類於   |   0 comments   |   
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        map<int, int> rem;
        vector<int> res;
        for (int i = 0; i < nums.size(); i++) {
            if (rem.find(nums[i])!=rem.end()) {
                res.push_back(rem[nums[i]]);
                res.push_back(i);
            }
            else {
                rem[target-nums[i]] = i;
            }
        }
        return res;
    }
};

version of 08/30/2015

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include <iostream>
#include <vector>
#include <map>
using namespace std;
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> res;
        map<int, int>test;
        for(int i=0;i<nums.size();i++){
            int t=nums[i];
            map<int,int>::iterator it = test.find(t);
            if(it!=test.end()){
                
//                if(test[j]==t){
                res.push_back(it->second+1);
                    res.push_back(i+1);
  //              }
            }
            test[target-nums[i]]=i;
        }
        return res;
    }
    
};