1. Two Sum
2016-07-31 19:57
85 查看
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.
Example:
思路:利用哈希容器快速查找。
You may assume that each input would have exactly one solution.
Example:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
思路:利用哈希容器快速查找。
class Solution { public: vector<int> twoSum(vector<int> &numbers, int target){ unordered_map<int, int> hash; vector<int> result; for (int i = 0; i < numbers.size(); i++) { int numberToFind = target - numbers[i]; if (hash.find(numberToFind) != hash.end()) { result.push_back(hash[numberToFind]); result.push_back(i); return result; } hash[numbers[i]] = i; } return result; } };
相关文章推荐
- LeetCode Online Judge 题目C# 练习 - Two Sum
- Two Sum
- leetcode--Two Sum
- Leetcode习题: Two Sum
- LeetCode (1) Two Sum (15)Three sum (16)Three sum closest (17)Four sum
- Two Sum
- 【Leetcode】Two Sum
- [LeetCode]Two Sum
- LeetCode Two Sum
- [LeetCode]Two Sum
- LeetCode题解——Two Sum
- [leetcode] Two Sum
- [leetcode] Two Sum
- 2.1.7 Two Sum
- Two Sum
- [Leetcode] Two Sum
- Two Sum
- [LeetCode]Two Sum
- Two Sum
- [LeetCode]Two Sum