Leetcode 167. Two Sum II - Input array is sorted (Medium) (cpp)
2016-08-20 11:20
429 查看
Leetcode 167. Two Sum II - Input array is sorted (Medium) (cpp)
Tag: Array, Two Pointers, Binary Search
Difficulty: Medium
/*
167. Two Sum II - Input array is sorted (Medium)
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=9
Output: index1=1, index2=2
*/
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
if (numbers.size() < 2) {
return {-1, -1};
}
for (int i = 0; i < numbers.size() - 1; i++) {
if (numbers[i] + numbers[i + 1] > target) {
break;
}
int l = i + 1, r = numbers.size() - 1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (numbers[mid] > target - numbers[i]) {
r = mid - 1;
} else if (numbers[mid] < target - numbers[i]) {
l = mid + 1;
} else {
return {i + 1, mid + 1};
}
}
}
return {-1, -1};
}
};
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
if (numbers.size() < 2) {
return {-1, -1};
}
int l = 0, r = numbers.size() - 1;
while (l < r) {
if (numbers[l] + numbers[r] > target) {
r--;
} else if (numbers[l] + numbers[r] < target) {
l++;
} else {
return {++l, ++r};
}
}
return {-1, -1};
}
};
Tag: Array, Two Pointers, Binary Search
Difficulty: Medium
/*
167. Two Sum II - Input array is sorted (Medium)
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=9
Output: index1=1, index2=2
*/
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
if (numbers.size() < 2) {
return {-1, -1};
}
for (int i = 0; i < numbers.size() - 1; i++) {
if (numbers[i] + numbers[i + 1] > target) {
break;
}
int l = i + 1, r = numbers.size() - 1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (numbers[mid] > target - numbers[i]) {
r = mid - 1;
} else if (numbers[mid] < target - numbers[i]) {
l = mid + 1;
} else {
return {i + 1, mid + 1};
}
}
}
return {-1, -1};
}
};
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
if (numbers.size() < 2) {
return {-1, -1};
}
int l = 0, r = numbers.size() - 1;
while (l < r) {
if (numbers[l] + numbers[r] > target) {
r--;
} else if (numbers[l] + numbers[r] < target) {
l++;
} else {
return {++l, ++r};
}
}
return {-1, -1};
}
};
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- C++中const用法总结
- CPP 虚函数、虚函数表及虚拟继承(转)
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- Deploying Control Plane Policing
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解