[leetcode]1. Two Sum

Description

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

Analysis

使用hash表，将vector nums中的数值与其下标一一对应，插入到hash map中。
当遍历nums中的数值时，判断在map中是否存在其“补集Complement”（即complement = target - nums[i]）。如果存在，则返回当前下标i与complement的下标j；如果不存在，则将nums[i]与其下标i插入hash map中。

这个代码好像效率很低的样子…马一个以后再改。

Code

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