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 vote217 views1 answer
Python dictionary value as set
Python
0 vote183 views1 answer
Scipy check normal distribution
Python
6 votes200 views4 answers
Uninstall python 2.7 in ubuntu
Python
34 votes152 views4 answers
Confusion matrix python
Python
15 votes250 views6 answers
Python filter
Python
0 vote204 views1 answer
Rapids - convert nerworkx to cugraph
Python
9 votes267 views6 answers
Pattern in python
Python
0 vote210 views2 answers
Push button raspberry pi
Python
0 vote198 views1 answer
Degree symbol in python
Python
1 vote211 views1 answer
ROLL D6
Python