两数之和,三种解法

时间o(n2)，空间o(1)，双重循环

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

时间o(n)，空间o(n)，先存再找

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

时间o(n)，空间o(nlogn)，边存边找

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