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]
class Solution:
def twoSum(self, numbers: List[int], target: int) -> List[int]:
#n = len(nums)
d = {}
for i, n in enumerate(numbers):
m = target - n
if m in d:
return ([d[m], i])
else:
d[n] = i
<<: DAY18-Mongo db atlas realm
>>: Day 15: Structural patterns - Facade
前面的检视团购讯息,检视团购讯息用文字不好检视 这边计画用matplotlib的pyplot将资讯输...
by CSS Animations- Guide to Cubic Bezier Curves 关...
就算拖拖拉拉,也可以把待办事项处理好 昨天虽然已经知道该如何使用 Drag & Drop ...
多张照片混合 教学原文参考:多张照片混合 这篇文章会介绍使用 GIMP,的图层,搭配混合模式、渐层色...
这篇主要是讲到有关 Python 中很重要的 import,因为如果後面在做大型专案时,常常需要 i...