LeetCode --- 167. Two Sum II - Input array is sorted 解题报告

杨鑫newlfe

于 2019-07-17 10:35:40 发布

阅读量278

点赞数

CC 4.0 BY-SA版权

分类专栏： Python 算法 LeetCode 文章标签： LeetCode Two Sum II - Input array is so 算法 ACM Python

本文链接：https://blog.youkuaiyun.com/u012965373/article/details/96281644

850 篇文章 ¥9.90 ¥99.00

订阅专栏

714 篇文章 ¥9.90 ¥99.00

订阅专栏

438 篇文章

订阅专栏

这篇博客详细介绍了LeetCode中的167题，即给定一个升序排列的整数数组，找到两个数使得它们的和等于特定的目标数。函数要求返回这两个数的索引，且index1小于index2。注意，答案不包含0-based索引，每输入都有唯一解，不能使用相同的元素两次。例如：...

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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,

了解本专栏