LeetCode1-两数之和
题目描述:方法一:暴力查找,简单的两层循环查找符合条件的索引:class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: res=[] n=len(nums) for i in range(0,n-1): for ...