167. Two Sum II
来源:互联网 发布:python经典程序实例 编辑:程序博客网 时间:2024/06/13 00:59
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) { if(numbers==null || numbers.length < 1) return null; int i=0, j=numbers.length-1; while(i<j) { int x = numbers[i] + numbers[j]; if(x<target) { ++i; } else if(x>target) { --j; } else { return new int[]{i+1, j+1}; } } return null; } }
阅读全文
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
- dubbo入门
- 查找 二(二叉排序树、平衡二叉树、)
- 电流反馈和电压反馈的判断
- 合并有序数组
- 函数调用过程解析
- 167. Two Sum II
- 【hdu 2098】 分拆素数和
- php5.6下soap一直报错(looks like we got no XML document in)
- numpy函数搜索方法
- 1st day of MySql
- WebGL之旅(十一)透视投影
- vue父子组件通信
- WebSocket 是什么原理?为什么可以实现持久连接?
- 苹果机之远程操作 | 隔空重启手机