Leetcode每日一题(20200720)

T167 两数之和 II - 输入有序数组(简单，二分查找+双指针)

题目描述

给定一个已按照升序排列 的有序数组，找到两个数使得它们相加之和等于目标数。

函数应该返回这两个下标值 index1 和 index2，其中 index1 必须小于 index2。

说明:

返回的下标值（index1 和 index2）不是从零开始的。
你可以假设每个输入只对应唯一的答案，而且你不可以重复使用相同的元素。
示例:

输入: numbers = [2, 7, 11, 15], target = 9
输出: [1,2]
解释: 2 与 7 之和等于目标数 9 。因此 index1 = 1, index2 = 2 。

算法

二分查找，双指针

python解法

#暴力搜索
class Solution:
    def twoSum(self, numbers, target) -> list:
        n = len(numbers)
        for i in range(n):
            if i > 1 and numbers[i - 2] == numbers[i]:
                continue
            for j in range(i + 1, n):
                if j > 1 and numbers[j - 2] == numbers[j]:
                    continue
                if numbers[i] + numbers[j] == target:
                    return [i + 1, j + 1]
                if numbers[i] + numbers[j] > target:
                    break

#二分查找
class Solution:
    def twoSum(self, numbers, target) -> list:
        n = len(numbers)
        for i in range(n - 1):
            left, right = i + 1, n - 1
            while left <= right:
                mid = left + (right - left) // 2
                if numbers[i] + numbers[mid] == target:
                    return [i + 1, mid + 1]
                if numbers[i] + numbers[mid] > target:
                    right = mid-1
                else:
                    left = mid + 1

#双指针
class Solution:
    def twoSum(self, numbers, target) -> list:
        n = len(numbers)
        left, right = 0, n - 1
        while left < right:
            if numbers[left] + numbers[right] == target:
                return [left + 1, right + 1]
            elif numbers[left] + numbers[right] > target:
                right -= 1
            else:
                left += 1

C++解法

//二分查找
class Solution
{
public:
    vector<int> twoSum(vector<int> &numbers, int target)
    {
        int n = numbers.size();
        for (int i = 0; i < n - 1; i++)
        {
            int num = target - numbers[i];
            int left = i + 1, right = n - 1;
            while (left <= right)
            {
                int mid = left + (right - left) / 2;
                if (num == numbers[mid])
                {
                    return {i + 1, mid + 1};
                }
                if (num > numbers[mid])
                {
                    left = mid + 1;
                }
                if (num < numbers[mid])
                {
                    right = mid - 1;
                }
            }
        }
        return {-1, -1};
    }
};

//双指针
class Solution
{
public:
    vector<int> twoSum(vector<int> &numbers, int target)
    {
        int left = 0, right = n - 1;
        while (left < right)
        {
            if (numbers[left] + numbers[right] == target)
            {
                return {left + 1, right + 1};
            }
            if (numbers[left] + numbers[right] < target)
            {
                left++;
            }
            else
            {
                right--;
            }
        }
        return {-1, -1};
    }
};

备注

注意二分查找的写法