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 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

思路1: target-element然后二分查找 O(nlogn)

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] result = new int[2];
        for(int i = 0; i < numbers.length; ++i)
        {
            int key = target-numbers[i];
            int index2 = binarySearch(numbers, key);
            //按题意要求,同样的下标不能重复使用
            if(index2  != -1 && i != index2)
            {
                result[0] = i < index2? i+1:index2+1;
                result[1] = i <index2?index2+1:i+1;
                break;
            }
        }
        return result;
    }
    private int binarySearch(final int[] numbers, int key)
    {
        int low = 0;
        int hi = numbers.length-1;
        while(low <= hi)
        {
            int mid = (hi+low)/2;
            if (numbers[mid] < key) {
                low = mid+1;
            }
            else if(numbers[mid] > key)
            {
                hi = mid-1;
            }
            else 
                return mid;
        }
        return -1;
    }
}

public class leetcode_TwoSumIIInputArrayIsSorted {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Solution solution = new Solution();
        int[] numbers ={1,2, 3,4,4,9,56,90};
        int[] result = solution.twoSum(numbers, 8);
        for (int i = 0; i < result.length; i++) {
            System.out.println(result[i]);
        }
    }

}

但由于题目所提示的是所给的测试用例中,每个测试用例只有唯一的答案!因此该题还可以用下面的思路来优化。

思路2:首尾两个指针,尾指针从后往前移动,首指针从前往后移动,缩小范围 O(n)

class Solution2 {
    public int[] twoSum(int[] numbers, int target) {
        int[] result = new int[2];
        int left = 0;
        int right = numbers.length-1;
        for(int i = 0; i < numbers.length; ++i)
        {
            int sum = numbers[left]+numbers[right];
            if(sum == target)
            {
                result[0] = left+1;
                result[1] = right+1;
                break;
            }
            else
            {
                if (sum < target)
                {
                    left++;
                }
                else
                    right --;
            }
        }
        return result;
    }
}

public class leetcode_TwoSumIIInputArrayIsSorted {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Solution2 solution = new Solution2();
        int[] numbers ={1,2, 3,4,4,9,56,90};
        int[] result = solution.twoSum(numbers, 8);
        for (int i = 0; i < result.length; i++) {
            System.out.println(result[i]);
        }
    }

}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

alw_123

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值