1. Two Sum

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

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

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]

Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]

Constraints:

• 2 <= nums.length <= 104
• -109 <= nums[i] <= 109
• -109 <= target <= 109
• Only one valid answer exists.

Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity?

此图来源于代码随想录网站

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};
            else hashtable[nums[i]]=i;
        }
        return {};
    }
};

注意：

        1.为什么想到用map，为什么是unordered_map？

        这里用到的有两个数，一个是数值，一个是下标，而且在这里，并不需要map是有序的

        2.map的作用？

        用来存储符合条件的数组元素和下标

        3.key和value分别表示什么？

        key表示数值，value表示下标（代码中是second），因为map查找key的速度比较快

        4.熟悉map的常见操作