167. Two Sum II
来源:互联网 发布:top的域名注册 编辑:程序博客网 时间:2024/06/03 14:23
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
双指针。
public class Solution { public int[] twoSum(int[] numbers, int target) { int i=0; int j=numbers.length-1; while(i<j){ if(numbers[i]+numbers[j]==target){ break; }else if(numbers[i]+numbers[j]>target){ j--; }else{ i++;} } return new int[]{i + 1, j + 1}; }}
阅读全文
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
- 使用FileUtils简化你的文件操作
- scrollview嵌套listview的解决方法(一)
- (二叉树)谈一谈各类算法和数据结构的c++实现以及相关操作的复杂度(二)
- C语言基础
- Spring AOP 错误:Pointcut is malformed: Pointcut is not well-formed
- 167. Two Sum II
- 关于Linux启动文件rc.local的解惑
- http请求
- spring普通java工程的配置启动方式
- androidSimpleCache的详细讲解
- iOS自定义UICollectionViewLayout布局实现瀑布流
- Spring5.0.X源码阅读环境搭建Eclipse4.6.3(neon)
- PyQt简单例子: 包括ui文件生成, 代码, 打包exe
- [PAT乙级]1033. 旧键盘打字(20)