leetcode 1 Two Sum
来源:互联网 发布:软件项目需求说明书 编辑:程序博客网 时间:2024/03/29 15:05
Given an array of integers,find two numbers such that they add up to a specific target number.
The function twoSum shouldreturn indices of the two numbers such that they add up to the target, whereindex1 must be less than index2. Please note that your returned answers (bothindex1 and index2) are not zero-based.
You may assume that eachinput would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
思路:先拷贝numbers,然后再将该副本排序,然后左右夹逼,排序O(n log n),左右夹逼O(n),最终O(n log n)。再把可能的数字在原数组中查找其index
class Solution {public: vector<int> twoSum(vector<int> &numbers, int target) { vector <int> temp;vector <int> ans;vector<int>::iterator it1;vector<int>::iterator it2;int i;int num;temp.resize(numbers.size());//这一步必不可少copy(numbers.begin(),numbers.end(),temp.begin());sort(temp.begin(),temp.end());it1=temp.begin();it2=temp.end()-1;//特别注意需要减一while(it1!=it2){if (( *it1 + *it2 )== target){ num=*it1; break;}else if(*it1+*it2>target) it2--;else it1++;}for(i=0;i<numbers.size();i++){if(numbers.at(i)==num||numbers.at(i)==(target-num)) {ans.push_back(i+1);cout<< i<<endl;}}return ans; }};
0 0
- LeetCode 1 - Two Sum
- leetcode 1 Two Sum
- Leetcode【1】:Two Sum
- [leetcode 1] Two Sum
- 【leetcode-1】Two Sum
- [leetcode 1] Two Sum
- [Leetcode] 1 - Two Sum
- LeetCode (1) Two Sum
- LeetCode 1:《Two Sum》
- LeetCode | #1 Two Sum
- leetcode-1 Two Sum
- Two Sum | LeetCode(1)
- [Leetcode]1Two Sum
- leetcode 1 Two Sum
- leetcode #1 Two Sum
- leetcode 1:Two Sum
- LeetCode 1 Two Sum
- leetcode #1 two sum
- 西北工业大学国家精品课--流媒体课程
- AHOI 2002 黑白瓷砖
- 创业失败的七个原因及解决之道
- java break接触
- 设计模式----IoC
- leetcode 1 Two Sum
- eclipse 快捷键
- Hive 配置安装
- win7 LoadRunner11破解“license security violation.Operation is not allowed”问题总结
- 员工离职的真正原因(送给成长中的各位)
- 约瑟夫问题
- 求帧差
- Python 初学笔记:递归解决0-1背包问题
- 《Java程序员面试笔试宝典》之Java变量命名有哪些规则