Given an array of integers nums
and an integer target
, return indices of the two numbers such that they add up to target
.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.
Example 1:
Input: nums = [2,7,11,15], target = 9 Output: [0,1] Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6 Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6 Output: [0,1]
Constraints:
2 <= nums.length <= 103
-109 <= nums[i] <= 109
-109 <= target <= 109
- Only one valid answer exists.
我提交的答案是:
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
for num1 in nums:
num1_index = nums.index(num1)
sub_lst = nums[num1_index+1:]
if target-num1 in sub_lst:
return [num1_index, num1_index+1+sub_lst.index(target-num1)]
结果是:
Success
Runtime: 40 ms, faster than 96.01% of Python3 online submissions for Two Sum.
Memory Usage: 14.5 MB, less than 54.28% of Python3 online submissions for Two Sum.