首页 > 代码库 > [LeetCode] 167. Two Sum II - Input array is sorted
[LeetCode] 167. Two Sum II - Input array is sorted
https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/
类似于 binary search
public class Solution { public int[] twoSum(int[] numbers, int target) { int[] result = new int[2]; int start = 0; int end = numbers.length - 1; while (start < end) { if (numbers[start] + numbers[end] == target) { result[0] = start + 1; result[1] = end + 1; break; } else if (numbers[start] + numbers[end] > target) { end--; } else { start++; } } return result; } }
[LeetCode] 167. Two Sum II - Input array is sorted
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。