1.Two Sum
来源:互联网 发布:剑侠情缘网络3电视剧 编辑:程序博客网 时间:2024/06/06 01:53
Click here to try this problem on Leetcode
Problems with tag: Array
Problems with tag : Hash Table
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:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.
思路:这道题目比较简单,直接建立Hash Table来解决就可以了。方法是,先建立一个nums数组的Hash Table;然后for-loop依次遍历每个元素,看是否能够在Hash Table中找到target - nums[i]
,如果能够找到,就返回i
和target - nums[i]
在Hash Table中对应的下标。
C++代码如下:
class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> res; unordered_map<int,int> map; for(int i = 0; i < nums.size(); i++){ int gap = target - nums[i]; if(map.find(gap) != map.end()) res = {i, map[gap]}; else map[nums[i]] = i; } return res; }};
Time: O(n).
Space: O(n).
相关题目:
0 0
- 1. Two Sum && 167. Two Sum II
- LeetCode 1. Two Sum
- [LeetCode]1.Two Sum
- LeetCode 1.Two Sum
- LeetCode --- 1. Two Sum
- 1.Two Sum
- [Leetcode] 1. Two Sum
- leetcode---1.Two sum
- 1.Two Sum
- [Leetcode] 1. Two Sum
- LeetCode 1.Two Sum
- 1. Two Sum
- 1. Two Sum
- 1. Two Sum Ruby
- LeetCode 1.Two Sum
- LeetCode 1.Two Sum
- 1. Two Sum
- 1.Two Sum
- android开发配置环境
- 知识点NIO-非阻塞I/O(转)
- 仿射变换透射变换单应性矩阵
- DataGrip使用入门-导出数据(四)
- Linux网络编程模型
- 1.Two Sum
- Linux下安装scala
- PopupWindow的简单使用
- DataGrip使用入门-常用操作(三)
- 我所拥有的
- 生命的朝圣者
- 关于网页设计的思路
- Android动画详解
- freopen重定向输出