-
[algorithm] Two SumAlgorithm/LeetCode 2021. 3. 9. 23:47
class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: for i in range(len(nums)) : for j in range(len(nums)) : if i==j : pass elif nums[i]+nums[j] == target : return [i,j]
개선 해보기 :
반응형