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

8 votes121 views1 answer
Delete certain characters from a string python
Python
0 vote122 views1 answer
Django form custom validation
Python
36 votes128 views6 answers
Move files in python
Python
0 vote120 views1 answer
Pandas print tabulate no index
Python
0 vote135 views1 answer
Update All Python Packages On Windows
Python
5 votes125 views2 answers
Python get min max value from a dictionary
Python
0 vote117 views1 answer
Python list to tuple pairs adjacent
Python
0 vote114 views1 answer
Compute slice distance from image position
Python
0 vote115 views1 answer
Python numpy find local minima
Python
21 votes127 views3 answers
Show all rows python
Python