167. Two Sum II
来源:互联网 发布:鳄鱼皮 知乎 编辑:程序博客网 时间:2024/05/16 17:29
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 and you may not use the same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
给一个排好顺序的数组,和给定值,在序列中找到两个元素的和是给定值
方法一:双指针
class Solution {public: vector<int> twoSum(vector<int>& numbers, int target) { int n=numbers.size()-1; int i=0; vector<int> res; while(i<n) { int sum=numbers[i]+numbers[n]; if(sum>target) n--; else if(sum<target) i++; else { res.push_back(i+1); res.push_back(n+1); break; } } return res; }};
0 0
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 3. Longest Substring Without Repeating Characters
- 方法调用
- Java中的三目运算符
- Spring + Spring Mvc + MyBatis 整合
- Problem D: 模板是个好东西
- 167. Two Sum II
- POJ 3311 Hie with the Pie(Floyd + 状压dp)
- 为什么使用%lf读取double型的值,而用%f进行显示?
- Tomcat启动时卡在“INFO: Deploying web application directory ”
- 计算机图形学实验————漫游三维迷宫
- 没有实习的我,如何拿到阿里产品 offer
- android客户端直接调用芝麻信用的人脸认证
- MySQL concat、concat_ws、group_concat函数用法
- shell date命令总结