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

9 votes138 views4 answers
Short if python
Python
2 votes139 views1 answer
Python list of all tkinter events
Python
0 vote152 views2 answers
Javascript parse url
Python
0 vote136 views1 answer
How to flatten the image dataset
Python
0 vote137 views2 answers
Flask get summernote text
Python
0 vote247 views1 answer
Request.args.get check if defined
Python
0 vote174 views1 answer
Remove cog in discord.py
Python
3 votes126 views1 answer
How to execute bash commands in python script
Python
0 vote132 views1 answer
Setting flask app environment variable
Python
0 vote152 views1 answer
Get timestamp with pyrhon
Python