LeetCode——twosum

#include <iostream>
#include <windows.h>
#include <time.h>
#include <vector>
#include <unordered_map>
using namespace std;
class Solution
{
public:
    vector<int>twoSum(vector<int> &numbers,int target)
    {
        unordered_map<int, int>mapping;
        vector<int>result;
        for (int i = 0; i < numbers.size();i++)
        {
            mapping[numbers[i]] = i;
        }
        for (int i = 0; i < numbers.size();i++)
        {
            const int gap = target - numbers[i];
            if (mapping.find(gap)!=mapping.end()&&mapping[gap]>i)
            {
                result.push_back(i + 1);
                result.push_back(mapping[gap]+1);
                break;
            }
        }
        return result;
    }
};
int main()
{
    Solution sum;
    vector<int>numbers= {2,7,11,15};
    int target = 9;
    time_t clockbegin, clockend;
    clockbegin = clock();
    sum.twoSum(numbers, target);
    clockend = clock();
    //cout << "花费时间为：" << clockend - clockbegin << endl;
    printf("%ld\n",clockend-clockbegin);
    getchar();
    return 0;
}