[Array]Two Sum
来源:互联网 发布:科比0506赛季数据 编辑:程序博客网 时间:2024/05/01 01:48
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.
Subscribe to see which companies asked this question
首先对数组进行排序,然后遍历数组,即针对每一个元素,寻找(target-nums[i]), 寻找的方法采用二分法。这样空间复杂度为O(n)(用来记录下标),排序时间复杂度为O(nlogn),遍历数组进行二分查找时间复杂度为O(nlogn)。
class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> res; vector<int> map(nums); sort(nums.begin(),nums.end()); for(int i = 0;i < nums.size();i++){ int value = target - nums[i]; int left=i+1,right=nums.size()-1; while(left<=right){ int middle = (left+right)/2; if(nums[middle]==value){ for(int j=0;j<map.size();j++){ if(map[j]==nums[i]||map[j]==value) res.push_back(j); } break; } if(value<nums[middle]){ right = middle-1; } else left = middle+1; } if(!res.empty()) break; } return res; }};
另外一种想法是利用map,大致思路是遍历一遍数组,将已经访问过的元素存入到map中,再利用value = target - 正在访问的元素,然后回到map中进行查找value。
class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> res; map<int,int> mp; map<int,int>::iterator it; for(int i=0;i<nums.size();i++){ int find_number = target - nums[i]; it = mp.find(find_number); if(it!=mp.end()){ res.push_back(it->second); res.push_back(i); break; } mp[nums[i]]=i; } return res; }};
0 0
- [Array]Two Sum
- array-Two Sum
- Leetcode - Pointers/Array - Two sum
- 1,Two sum (Hashtable Array)
- 1.Two Sum leetcode(array)
- LeetCode-Array-1. Two Sum
- LeetCode刷题【Array】 Two Sum
- leetcode.array--1. Two Sum
- Array -- Leetcode problem1. Two Sum
- LeetCode(Array)---------Two Sum
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- 【小熊刷题】Two Sum <Array/String>
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- Split array into two equal sum subArray
- Two Sum II - Input array is sorted
- 编程规范
- jquery遍历数组的问题
- 【JavaWeb开发】Eclipse或MyEclipse配置Tomcat
- 慢启动以及传输原理
- jquery onready的问题
- [Array]Two Sum
- poj 2892 Tunnel Warfare(树状数组+二分)
- JAVA设计模式之单例模式
- jquery mobile.js文件与jquery.js的插入顺序
- cocos2dx 基础知识
- c++关闭io同步流
- 博客自荐(十一期 2016年07月)
- 手把手教你用python写脚本看caffe训练好的网络测试单张图片的输出
- java中哈希表,Map,HashCode,Equals等介绍