[旧版] LeetCode Two Sum
来源:互联网 发布:窗帘的尺寸怎么算法 编辑:程序博客网 时间:2024/04/29 03:53
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
class Solution {public: vector<int> twoSum(vector<int> &numbers, int target) { vector<int> v(numbers); sort(v.begin(),v.end()); vector<int>::iterator ia = v.begin(); vector<int>::iterator ib = v.end(); int a,b; ib--; while(ia < ib) { if(*ia+*ib > target) { ib--; }else if(*ia+*ib < target) { ia++; }else { a = *ia; b = *ib; break; } } vector<int> r; for(int i = 0; i < numbers.size();i++) { if(numbers[i]==a || numbers[i]==b) { r.push_back(i+1); } } return r; }};
思路:暴力解法是O(n^2)。这种解法是O(nlogn)。
关键之处在于排序后首尾指针步进的解法可行,复杂度O(n),算法复杂度为排序复杂度。
最后的for循环查找也很精妙。
0 0
- [旧版] LeetCode Two Sum
- [旧版] LeetCode 3Sum Closest
- 【Leetcode】Two Sum (Sum)
- LeetCode: Two Sum
- LeetCode: Two Sum
- [Leetcode] Two Sum
- LeetCode : Two Sum
- Leetcode: Two Sum
- leetcode 46: Two Sum
- [LeetCode] Two Sum
- LeetCode 1 - Two Sum
- Leetcode : Two Sum
- 【leetcode】Two Sum
- [LeetCode]Two Sum
- leetcode Two Sum
- [Leetcode] Two Sum
- [leetcode] Two Sum
- LeetCode - Two Sum
- iOS 7人机交互指南-Icon和Image设计-Icon and Image Sizes(icon和图片尺寸)
- MyEclipse的一个项目名字上显示有误的解决方案
- 找零钱
- PLC及其编程起步[.net]
- linux 编译boost
- [旧版] LeetCode Two Sum
- 后台webservice返回JSON,前台js用ajax调用
- HFile V2
- ubuntu下发布Django Web的两种方法
- bzoj 1208: [HNOI2004]宠物收养所
- Android 软键盘监听事件
- SSDB基础说明及使用
- 准备加入第二个项目(第5960小时加入)
- SRDC - Data Collection for Listener Hang (Doc ID 1677251.1)