标签:function example turned pac sorted should target less return
1. Question:
167. Two Sum II - Input array is sorted
url : https://leetcode.com/problems/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.
Note:
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.
2. Solution:
class Solution(object): def twoSum(self, numbers, target): """ :type numbers: List[int] :type target: int :rtype: List[int] """ size = len(numbers) i = 0 j = size - 1 while i < j: tmp_sum = numbers[i] + numbers[j] if tmp_sum == target: return (i + 1, j + 1) if tmp_sum > target: j -= 1 if tmp_sum < target: i += 1
3. Complexity Analysis
Time Complexity : O(N)
Space Complexity: O(1)
167. Two Sum II - Input array is sorted
标签:function example turned pac sorted should target less return
原文地址:https://www.cnblogs.com/ordili/p/9986471.html