[LeetCode167]Two Sum II - Input array is sorted
来源:互联网 发布:python ui开发 编辑:程序博客网 时间:2024/05/21 07:09
Given an array of integers that is already sorted in ascending order, 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=9Output: index1=1, index2=2Hide Company Tags AmazonHide Tags Array Two Pointers Binary SearchHide Similar Problems (M) Two Sum
这题跟two sum 不是一样吗?当时做的时候就 sort original array first。
然后come up with a O(n) method:
class Solution {public: vector<int> twoSum(vector<int>& numbers, int target) { int lo = 0, hi = numbers.size()-1; vector<int> res; while(lo<=hi){ if(numbers[lo] + numbers[hi] < target) ++lo; else if(numbers[lo] + numbers[hi] > target) --hi; else { res.push_back(lo+1); res.push_back(hi+1); break; } } return res; }};
然后看看tag: binary search O(nlogn), less efficient.
但我不知道怎么写,懒:
class Solution {public: vector<int> twoSum(vector<int>& numbers, int target) { if(numbers.empty()) return {}; for(int i=0; i<numbers.size()-1; i++) { int start=i+1, end=numbers.size()-1, gap=target-numbers[i]; while(start <= end) { int m = start+(end-start)/2; if(numbers[m] == gap) return {i+1,m+1}; else if(numbers[m] > gap) end=m-1; else start=m+1; } } } };
0 0
- Leetcode167 - Two Sum II - Input array is sorted(two pointers)
- [LeetCode167]Two Sum II - Input array is sorted
- leetcode167. Two Sum II - Input array is sorted
- LeetCode167—Two Sum II - Input array is sorted
- Leetcode167. Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- Two Sum II - Input array is sorted
- LeetCode167---Input array is sorted
- leetcode 167: Two Sum II - Input array is sorted
- Leetcode NO.167 Two Sum II - Input array is sorted
- LeetCode-Two Sum II - Input array is sorted
- [Leetcode]Two Sum II - Input array is sorted
- [LeetCode158]Read N Characters Given Read4 II - Call multiple times
- [LeetCode160]Longest Substring with At Most Two Distinct Characters
- 强大数定理
- [LeetCode161] One Edit Distance
- [LeetCode163]Missing Ranges
- [LeetCode167]Two Sum II - Input array is sorted
- 一个简单的马尔可夫过程例子
- Volley源码解析
- B-树和B+树的应用:数据搜索和数据库索引【转】
- S3C6410的tv out输出lcd的内容
- [LeetCode170]Two Sum III - Data structure design
- [LeetCode186]Reverse Words in a String II
- [LeetCode243]Shortest Word Distance
- [LeetCode244]Shortest Word Distance II