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

2 votes218 views1 answer
Convert time zone pandas
Python
0 vote203 views1 answer
"api_view" is not definedPylance
Python
0 vote259 views1 answer
How to make it so we can give unlimited parameters in python function
Python
0 vote209 views2 answers
Converting pandas._libs.tslibs.timedeltas.Timedelta to days
Python
0 vote204 views4 answers
Boxplot python
Python
1 vote201 views2 answers
First row as column df
Python
1 vote201 views1 answer
Matplotlib change bar color under threshold
Python
6 votes197 views4 answers
List iteration
Python
0 vote202 views1 answer
Np.argmax python could not be evaluated
Python
0 vote193 views1 answer
How to slice a set in python
Python