2020-01-01

2020-01-01  本文已影响0人  盯着苹果树的猫
C++代码:
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> num;
        vector<int> rec;
        for (int i = 0; i < nums.size(); i++)
        {
            if (num.count(target - nums[i]))
            {
                rec.push_back(num[target - nums[i]]);
                rec.push_back(i);
            }
            num[nums[i]] = i;
        }
        return rec;
    }
};         
上一篇 下一篇

猜你喜欢

热点阅读