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 vote226 views1 answer
Append to list in dictionary python if exists
Python
2 votes237 views2 answers
Get rid of unnamed column pandas
Python
0 vote261 views1 answer
How to interrupt a loop in python
Python
1 vote248 views3 answers
Isinstance python
Python
18 votes278 views5 answers
Flask minimal app
Python Flask
0 vote260 views1 answer
Python selenium set attribute of element
Python
0 vote225 views1 answer
Como calcular el rango en python
Python
1 vote231 views1 answer
Number of total words in cell pandas
Python
22 votes277 views3 answers
How to stop the program in python
Python
1 vote242 views1 answer
Convert number to time python
Python