LeetCode 学习记录 1.Two Sum

1 题目要求：

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].

2 解决方案

穷举算法：

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

时间复杂度：O(n2) 

空间复杂度：O(1)

HashTable算法：

vector<int> twoSum(vector<int>& nums, int target) {
	vector<int> result;
	unordered_map<int, int> hash;
	int res;
	for (int i = 0; i < nums.size(); i++) {
		res = target - nums[i];
		unordered_map<int, int>::iterator it = hash.find(res);
		if (it != hash.end()) {
			result.push_back(it->second);
			result.push_back(i);
			break;
		}
		hash[nums[i]] = i;
	}
	return result;
}

时间复杂度：O(n) 

空间复杂度：O(n)

3 总结

特定值的查找可以将遍历问题优化为哈希表存储，通过增加空间复杂度降低时间复杂度。map适用于需要数据排序的场景，unordered_map查找效率更高。