leetcode/problems/1/TwoSum.cc at master · shunminli/leetcode · GitHub

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
29
30
31
32
33
34
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
using namespace std;

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        map<int, int> numMap;
        vector<int> res;
        for (int i = 0; i < nums.size(); i++) {
            const int targetNum = target - nums[i];
            if (numMap.find(targetNum) != numMap.end()) {
                res.push_back(numMap[targetNum]);
                res.push_back(i);
                return res;
            }

            numMap[nums[i]] = i;
        }

        return res;
    }
};

int main() {
    Solution solution;
    int a[] = {2, 7, 11, 15} ;
    vector<int> inp(a, a + 4);
    const vector<int> res = solution.twoSum(inp, 9);
    cout << res[0] << " " << res[1] << endl;
    return 0;
}