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 vote112 views1 answer
How to take screenshots with selenium webdriver python
Python
50 votes114 views3 answers
Pandas save without index
Python
1 vote99 views1 answer
Python name 'List' is not defined
Python
11 votes101 views2 answers
__str__()
Python
0 vote167 views1 answer
Count entries groupby
Python
0 vote104 views1 answer
File "demo_indentation_test.py", line 2 print("Five is greater than two!") ^ IndentationError: expected an indented block
Python
0 vote106 views1 answer
How to bold in colorama
Python
2 votes108 views1 answer
Tkinter info box
Python
0 vote102 views1 answer
Set pytesseract cmd path
Python
1 vote114 views1 answer
Text size legend to bottom matplotlib
Python