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

0 vote204 views1 answer
How to let the user input desmials in python
Python
0 vote198 views1 answer
Saaaaaaaaaaaaa
Python
0 vote212 views1 answer
Grouped box plot in python
Python
1 vote211 views1 answer
How to find ip address of website using python
Python
0 vote278 views1 answer
Update All Python Packages On Windows
Python
0 vote254 views1 answer
Brownie transaction info
Python
0 vote203 views5 answers
Python trace table generator
Python
0 vote198 views1 answer
Django serializer,
Python
12 votes202 views3 answers
Python check if input is a number
Python
0 vote184 views1 answer
Debug console shows blank
Python