【LeetCode】167. Two Sum II - Input array is sorted
2017-08-14 11:09
393 查看
题解：两指针
vector<int> twoSum(vector<int>& numbers, int target) {
int i=0,j=numbers.size()-1;
vector<int> ans(2);
while(i<j)
{
int sum=numbers[i]+numbers[j];
if(sum<target)i++;
else if(sum>target)j--;
else{
ans[0]=i+1;ans[1]=j+1;
return ans;
}
}
}
vector<int> twoSum(vector<int>& numbers, int target) {
int i=0,j=numbers.size()-1;
vector<int> ans(2);
while(i<j)
{
int sum=numbers[i]+numbers[j];
if(sum<target)i++;
else if(sum>target)j--;
else{
ans[0]=i+1;ans[1]=j+1;
return ans;
}
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 167. Two Sum II - Input array is sorted
- LeetCode-Easy部分中标签为 Binary Search 167. Two Sum II - Input array is sorted
- [leetcode 刷题记录] 167. Two Sum II - Input array is sorted
- [leetcode]167. Two Sum II - Input array is sorted
- [leetcode]#167. Two Sum II - Input array is sorted
- 【Leetcode】167. Two Sum II - Input array is sorted
- LeetCode-167. Two Sum II - Input array is sorted
- Leetcode 167. Two Sum II - Input array is sorted
- leetcode-167. Two Sum II - Input array is sorted
- [leetcode] 1. twoSum; 167. Two Sum II - Input array is sorted; 15. threeSum; 16. 3Sum Closest; 18. 4
- LeetCode 167. Two Sum II - Input array is sorted （两数之和之二 - 输入的是有序数组）
- Leetcode 167. Two Sum II - Input array is sorted（Easy）
- leetcode题解-167. Two Sum II - Input array is sorted
- Leetcode 167. Two Sum II - Input array is sorted (Medium) (cpp)
- [leetcode]167. Two Sum II - Input array is sorted
- LeetCode - 167. Two Sum II - Input array is sorted - O(n) - ( C++ ) - 解题报告
- leetcode 167. Two Sum II - Input array is sorted
- leetcode167. Two Sum II - Input array is sorted
- LeetCode167. Two Sum II - Input array is sorted
- 【LeetCode】167. Two Sum II - Input array is sorted