博客

leetcode 1两数之和

  • Post author:
  • Post category:其他



官解
 

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> hashtable;
        for (int i = 0; i < nums.size(); ++i) {
            auto it = hashtable.find(target - nums[i]);
            if (it != hashtable.end()) {
                return {it->second, i};
            }
            hashtable[nums[i]] = i;
        }
        return {};
    }
};


版权声明：本文为qq_42967669原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。