LeetCode 167. Two Sum II
来源:互联网 发布:网络的安全机制有哪些 编辑:程序博客网 时间:2024/06/05 04:40
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[] nums, int target) { int[] result = new int[2]; int begin = 0; int end = nums.length - 1; while (begin < end) { if (nums[begin] + nums[end] == target) { result[0] = begin + 1;//直接存放下标 result[1] = end + 1; break; } else if (nums[begin] + nums[end] < target) { begin++; } else if (nums[begin] + nums[end] > target) { end--; } }//while return result; }//twoSum}
16 / 16 test cases passed.
Status: Accepted
Runtime: 3 ms
Your runtime beats 24.35 % of java submissions.
时间复杂度是O(n)
阅读全文
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
- 2017百度之星 资格赛 1003
- thinkphp表现层中的路径问题
- 第七章 常用类
- linux磁盘分区管理
- RedisTemplate 的hash结构测试类, 使用场景 购物车
- LeetCode 167. Two Sum II
- 将Java文件转换为HTML文件
- JavaScrip的数据类型及变量
- 第八章 集合
- Javaweb题
- ReactNative之FlatList组件使用方法总结
- web性能优化之DOM篇
- jdbc在模糊搜索时候报错:Parameter index out of range
- 字符串与字符数组的区别