LeetCode | 167. Two Sum II
来源:互联网 发布:手机脚本软件 编辑:程序博客网 时间:2024/04/30 00:52
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
题目链接
直接用两个双向指针找出target的加数。
public class Solution { public int[] twoSum(int[] numbers, int target) { int[] locs = new int[2]; int left = 0; int right = numbers.length - 1; int temp; while(left < right) { temp = numbers[left] + numbers[right]; if(temp == target) { locs[0] = left + 1; locs[1] = right + 1; break; } else if(temp < target) { left++; } else { right--; } } return locs; }}
0 0
- LeetCode-167. Two Sum II
- leetcode 167. Two Sum II
- [leetcode]167. Two Sum II
- leetcode 167. Two Sum II
- leetcode 167. Two Sum II
- LeetCode | 167. Two Sum II
- LeetCode:167. Two Sum II
- [LeetCode]167. Two Sum II
- [LeetCode]167. Two Sum II
- LeetCode 167. Two Sum II
- LeetCode 167. Two Sum II
- [leetcode]: 167. Two Sum II
- LeetCode 167. Two Sum II
- 【Leetcode】167. Two Sum II
- [leetcode]167. Two Sum II
- LeetCode 167. Two Sum II
- LeetCode 167. Two Sum II
- LeetCode 167. Two Sum II
- 在Android Studio中进行UI测试
- java中的阻塞线程
- 您的设计模式——建造者模式【Builder Pattern】
- C++建模实战1-高考录取系统(7)
- PHP中的正则表达式的优化
- LeetCode | 167. Two Sum II
- 设计模式随笔之适配器模式(Adapter)
- 积分系统文件上传之FormData对象
- Codeforces Beta Round #9 (Div. 2 Only) D. How many trees? dp
- hive中内部表和外部表的区别
- NSNotification、KVO、Delegate的同步和异步问题
- Android系统编程思想篇:建造者模式
- .NET 中的委托
- PAT