LeetCode1-两数之和
原题链接:https://leetcode-cn.com/problems/two-sum/submissions/
解题思路:暴力法
代码:
1 class Solution: 2 # 暴力法 3 def twoSum(self, nums: List[int], target: int) -> List[int]: 4 cnt = len(nums) 5 for i in range(cnt): 6 for j in range(i+1, cnt): 7 if nums[i] + nums[j] == target: 8 return [i, j]