Datawhale-LeetCode集训打卡-两数之和

• 参加Datawhale-LeetCode集训打卡-第一天-两数之和
• Brute Force

参加Datawhale-LeetCode集训打卡-第一天-两数之和

Brute Force

class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
sum = []
for i in range(0, len(nums)):
for j in range(i+1, len(nums)):
if nums[i] + nums[j] == target:
sum.append(i)
sum.append(j)
return sum