leetcode Two Sum
来源:互联网 发布:项目管理系统 源码 编辑:程序博客网 时间:2024/06/07 05:25
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> tmp(numbers.begin(), numbers.end()); vector<int> res; std::sort(numbers.begin(), numbers.end()); int left=0, right=numbers.size() -1; while(left<right) { if(numbers[left]+numbers[right]>target) { right--; } else if(numbers[left]+numbers[right]<target) { left++; } else break; } for(size_t i=0; i<numbers.size();i++) if(tmp[i] == numbers[left] || tmp[i] == numbers[right]) res.push_back(i+1);std::sort(res.begin(), res.end()); return res; }};
0 0
- 【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
- leetcode之Two Sum
- LeetCode | Two Sum
- 23种设计模式(四)
- POJ 1915 Knight Moves
- hdu 3917 最大权闭合图
- Java Generic
- 华为面试题目
- leetcode Two Sum
- SQL基础语法-W3School
- leetcode Median of Two Sorted Arrays
- hdu 3068 最长回文 manacher算法
- 验证是否有重复数据
- ACM-大数N!的位数公式
- leetcode 3Sum Closest
- 计算机为什么要用补码?
- H2 Database doc 阅读记录