Leetcode--Two Sum
2017-08-13 09:21
232 查看
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].
Solution
class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> map; vector<int> res; for(int i = 0; i < nums.size(); i++) { int other = target - nums[i]; if(map.find(other)!=map.end()) { res.push_back(map[other]); res.push_back(i); return res; } map[nums[i]] = i; } return res; } };
Review
sum = a + b解法用到了
vector<int>,实际就是int类型;
对于
unordered_map<int, int> map,
如果需要内部元素自动排序,使用map,不需要排序使用
unordered_map,因为我们这里只需要寻找b = (sum - a)是否在数组里,所以不必排序,使用
unordered_map,函数find()用于返回元素在数组中的位置,若
map.find(b) != map.end(),说明b存在。
Leetcode–Two Sum
相关文章推荐
- LeetCode(62)-Two Sum
- LeetCode-1-Two Sum
- leetcode: two sum
- LeetCode 01 Two Sum
- LeetCode: Two Sum
- leetcode: 1 Two Sum
- 【LeetCode】Two Sum
- [LeetCode]Two Sum 【Vector全局指针的使用】
- Leetcode代码学习周记——Two Sum
- 【Leetcode】Two sum
- LeetCode 1.Two Sum
- leetcode 1.Two Sum
- LeetCode:Two Sum
- (python)leetcode刷题笔记 01 TWO SUM
- [LeetCode]Two Sum
- leetcode problem solve 1——Two Sum
- [LeetCode]#1 Two Sum
- 【LeetCode】001. Two Sum
- leetcode刷题笔记-two sum
- LeetCode-Two Sum