167. Two Sum II
来源:互联网 发布:此何遽不为福乎的为 编辑:程序博客网 时间:2024/06/05 16:34
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
java
class Solution { public int[] twoSum(int[] nums, int target) { if (nums == null || nums.length < 2) { return new int[] {}; } int left = 0; int right = nums.length - 1; int value = 0; while (left < right) { value = nums[left] + nums[right]; if (left < right && value < target) { left++; } else if (left < right && value > target) { right--; } else { return new int[] {left + 1, right + 1}; } } return new int[]{}; }}
阅读全文
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
- eclipse clean 之后无法运行的问题
- Spring Boot属性配置文件详解
- 作业7
- Asp.net中SessionState相关配置
- 2017.10.19 第九天总结
- 167. Two Sum II
- 菜鸟学Java--包装类及其用法
- mycat1.6.5分片规则
- java按照等级输出学生的成绩
- virtualBox 安装 centos 7 虚拟机
- Builder模式在Java,Android中的应用
- [设计]访问者模式
- 学习心得
- Java中可变长参数的使用及注意事项