Two Sum II - Input array is sorted(leetcode167) - Solution1

Q: 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.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

Two Sum II - Input array is sorted

public class Solution2 {
  public int[] twoSum(int[] numbers, int target) {
    for(int i = 0; i < numbers.length; i++){
      int j = bSearch(numbers, target - numbers[i], i + 1);
      if(j != -1){
      return new int[] {i+1, j+1};
      }
    }
    throw new IllegalArgumentException("No two sum solution!");
  }

  public int bSearch(int[] a, int key, int start){
    int l = a.length - 1;
    while(start <= l){
      int m = (start + l)/2;
      if (a[m] < key){
        start = m + 1;
      } else if(a[m] > key) {
        l = m - 1;

      } else {
        return m;
      }

    }
    return -1;

  }
}

时间: 2024-10-13 22:44:10

Two Sum II - Input array is sorted(leetcode167) - Solution1的相关文章

Two Sum II - Input array is sorted(leetcode167) - Solution2

Q: 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 index

【LeetCode】167. Two Sum II - Input array is sorted

Two Sum II - Input array is sorted 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 a

leetcode2 Two Sum II – Input array is sorted

Two Sum II – Input array is sorted [email protected] Question: Similar to Question [1. Two Sum], except that the input array is already sorted in ascending order. 同上题:先排序,然后从开头和结尾同时向中间查找,原理也比较简单.O(nlogn) runtime, O(1) space vector<int> twoSumSored(v

LeetCode_167. Two Sum II - Input array is sorted

fsaf 167. Two Sum II - Input array is sorted Easy 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 s

LeetCode167. Two Sum II - Input array is sorted(双指针)

题意:对于一个有序数组,输出和为target的两个元素的下标.题目保证仅有唯一解. 分析: 法一:二分.枚举第一个元素,二分找另一个元素,时间复杂度O(nlogn),非最优解. class Solution { public: vector<int> twoSum(vector<int>& numbers, int target) { int len = numbers.size(); vector<int> ans; for(int i = 0; i <

[LeetCode] Two Sum II - Input array is sorted 两数之和之二 - 输入数组有序

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 mu

167. Two Sum II - Input array is sorted - Easy

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 m

[LC] 167. Two Sum II - Input array is sorted

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 m

[LeetCode] Two Sum II - Input array is sorted

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 m