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 vote167 views1 answer
How to run different python version
Python
9 votes126 views1 answer
Jupyter notebook extensions
Python
2 votes173 views2 answers
Python program to find first n prime numbers
Python
0 vote161 views1 answer
Jet 4 access python password
Python
2 votes164 views1 answer
And condition with or in django
Python
2 votes156 views1 answer
Python convert a string to a list of words
Python
0 vote123 views1 answer
Replace all string in list python
Python
43 votes161 views5 answers
Iterrows pandas
Python
0 vote159 views1 answer
Python class overwrite length method
Python
1 vote166 views1 answer
Jupyter notebook how to set max display row columns matrix numpy
Python