2021-07-10两数之和

力扣

暴力遍历，时间复杂度O(n^2)

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> res(2,0);
        for(int i = 0;i<nums.size();i++)
        {
            for(int j= i+1;j<nums.size();j++)
            {
                if(nums[i] + nums[j] == target)
                {
                    res[0] = i;
                    res[1] = j;
                    return res;
                }
            }
        }
        return res;
    }
};

哈希表法，时间复杂度O(n),空间复杂度也为O(n)

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 {};
    }
};