LeetCode1 Two Sum 两数相加等于某数

问题描述：
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].
思路：

解法1

两重循环进行暴力搜索，当出现符合条件的两个数时返回其坐标，时间代价为O(n^2).

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

解法2

为了减小时间复杂度，我们使用Hash表来记录nums中元素值和相应位置的映射，使得时间复杂度可以降为O(n).

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

解法3

在解法2中，我们便利了两次数组，但实际上我们只需要遍历一次，然后将遇到过的数记录下来就可以了，但是要注意两个数相同时只能记录其中一个的位置。

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