167. Two Sum II - Input array is sorted

最新推荐文章于 2022-03-03 22:26:10 发布

蝴蝶飞过城市高楼

最新推荐文章于 2022-03-03 22:26:10 发布

阅读量105

点赞数 1

分类专栏： LeetCode

本文链接：https://blog.csdn.net/murasakino/article/details/90106878

版权

LeetCode 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

文章目录

- 167. Two Sum II - Input array is sorted

167. Two Sum II - Input array is sorted

https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/

Description

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.

Note:

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

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

Solutions

这题和第一题不同的地方在于sorted in ascending order，数组内已经排好序了，可以用双指针从两段开始遍历起。

Submissions

class Solution {
    public int[] twoSum(int[] numbers, int target) 
    {
        int first=0, last=numbers.length-1;
        while(numbers[first]+numbers[last] !=target)
        {
            if(numbers[first]+numbers[last] > target)
                last--;
            else first++;
        }
        return new int[]{first+1,last+1};
    }
}