Python leetcode

# Solution for Leetcode1: Two Sum problem
# Time complexity: O(n) and Space complexity: O(n)
# n is the size of the input list, namely nums

"""
Given an array of integers nums and an integer target, 
return indices of the two numbers such that they add up to target.
"""
class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        hashmap = {}
        for i in range(len(nums)):
            complement = target - nums[i]
            if complement in hashmap:
                return [i, hashmap[complement]]
            hashmap[nums[i]] = i

Leetcode python

def merge(self, nums1, m, nums2, n):
        while m > 0 and n > 0:
            if nums1[m-1] >= nums2[n-1]:
                nums1[m+n-1] = nums1[m-1]
                m -= 1
            else:
                nums1[m+n-1] = nums2[n-1]
                n -= 1
        if n > 0:
            nums1[:n] = nums2[:n]

Similar codes

1 vote317 views2 answers
Joblib
Python
0 vote293 views1 answer
Python tuples number Multiplication
Python
0 vote283 views1 answer
Pip not downlaoding cryptography wheel macos
Python
1 vote246 views2 answers
Python get attributes of class
Python
0 vote260 views1 answer
Parse list from string
Python
0 vote274 views1 answer
Python remove dtype from array
Python
0 vote265 views1 answer
Os.system('clear')
Python
0 vote273 views1 answer
Truncatechars django
Python
0 vote240 views1 answer
Http.client.invalidurl: url can't
Python
-6 votes239 views1 answer
Download any file from link colab
Python