[LeetCode By Python]167. Two Sum II - Input array is sorted-白红宇

[LeetCode By Python]167. Two Sum II - Input array is sorted

阅读量：4055 次

发布时间：2019-05-25

本文共 956 字，大约阅读时间需要 3 分钟。

题目：

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

代码：

第一想法是二分求解，冷静下来后仍然使用两个指针，左指针（0）右指针（len(nums)-1)的数相加大于target，右指针左移，小左指针右移，相等加1输出

class Solution(object):    def twoSum(self, numbers, target):        """        :type numbers: List[int]        :type target: int        :rtype: List[int]        """        leftnum = 0; rightnum = len(numbers)-1        while leftnum
   
    target:                rightnum-=1            elif a

输出：

➜  leetcode python leecoder.py[2, 3]

转载地址：http://zkhci.baihongyu.com/

你可能感兴趣的文章

[互联网关注]李开复教大学生回答如何学好编程