[LeetCode By Python]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 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)-1while leftnum<rightnum:a = numbers[leftnum]+numbers[rightnum]if a>target:rightnum-=1elif a<target:leftnum+=1else:return [leftnum+1,rightnum+1]return
a = Solution()
print a.twoSum([1,2,7,11,15,18],9)

输出：

➜  leetcode python leecoder.py
[2, 3]

[LeetCode By Python]167. Two Sum II - Input array is sorted相关推荐

167. Two Sum II - Input array is sorted (C, C++, Python)
本文讲述了Array类中第167个问题的几种解法,实现语言包括C,Python以及C++. 问题: Given an array of integers that is already sorted ...
【LeetCode 剑指offer刷题】数组题2：57 有序数组中和为s的两个数（167 Two Sum II - Input array is sorted）...
[LeetCode & 剑指offer 刷题笔记]目录(持续更新中...) 57 有序数组中和为s的两个数题目描述输入一个递增排序的数组和一个数字S,在数组中查找两个数,是的他们的和正好是 ...
LeetCode 167. Two Sum II - Input array is sorted
题目 : Given an array of integers that is already sorted in ascending order, find two numbers such tha ...
leetcode python3 简单题167. Two Sum II - Input array is sorted
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百六十七题 (1)题目英文: Given an array of intege ...
leetcode 167 Two Sum II - Input array is sorted
给定一个有序的数组,和一个整数目标,求两个数的和等于目标的索引,索引从1开始.假设必定存在解. 有两种思路: 直接找: vector<int> twoSum(vector<int&g ...
167. Two Sum II - Input array is sorted 两数之和 II - 输入有序数组
Title 给定一个已按照升序排列的有序数组,找到两个数使得它们相加之和等于目标数. 函数应该返回这两个下标值 index1 和 index2,其中 index1 必须小于 index2. 说明: ...
167. Two Sum II - Input array is sorted
问题描述解决方案 class Solution { public:vector<int> twoSum(vector<int>& numbers, int targe ...
167. Two Sum II - Input array is sorted两数之和
1. 原始题目给定一个已按照升序排列的有序数组,找到两个数使得它们相加之和等于目标数. 函数应该返回这两个下标值 index1 和 index2,其中 index1 必须小于 index2. 说明 ...
LeetCode 167. Two Sum II - Input array is sorted--Python解法
题目地址:Two Sum II - Input array is sorted - LeetCode Given an array of integers that is already sorted ...

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

[LeetCode By Python]167. Two Sum II - Input array is sorted相关推荐

最新文章

热门文章