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 vote152 views1 answer
Python ctypes get current window
Python
29 votes215 views6 answers
Install python ubuntu
Python
21 votes319 views5 answers
Base64 python decode
Python
21 votes203 views1 answer
Python today plus 1 day
Python
4 votes202 views1 answer
How to calculate rmse in linear regression python
Python
9 votes205 views2 answers
How to run linux command in python
Python
68 votes190 views6 answers
Python dict sort by value
Python
0 vote186 views1 answer
Python send sms
Python
0 vote249 views1 answer
Python get value from list
Python
5 votes249 views3 answers
Update in django orm
Python Django