LeetCodeDiary

A Diary for solving LeetCode problems

View on GitHub
class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        l = len(nums)
        for i in range(l-1):
            for j in range(i+1,l):
                if nums[i]+nums[j] == target:
                    return [i,j]