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 vote186 views1 answer
Elif in django template
Python Django
0 vote131 views1 answer
Leetcode 206 python
Python
10 votes131 views4 answers
Python filename without extension
Python
1 vote163 views1 answer
Flask blueprints
Python Flask
4 votes135 views2 answers
Python rotate screen
Python
0 vote127 views1 answer
Getch backspace pytohn
Python
92 votes132 views6 answers
Python choose random element from list
Python
1 vote129 views2 answers
Python not null
Python
0 vote123 views1 answer
How can I print all items in a tuple, separated by commas?
Python
1 vote125 views2 answers
Python dataframe remove header
Python