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 vote171 views2 answers
How to swap two variables without using third variable python
Python
0 vote180 views1 answer
How to make text change lines pygame
Python
0 vote185 views1 answer
Python cache return value
Python
1 vote185 views1 answer
Display cv2 image in jupyter notebook
Python
2 votes203 views1 answer
Not x axis labels python
Python
1 vote166 views1 answer
How to split a string by colon in python
Python
19 votes188 views1 answer
Error tokenizing data. c error
Python
-2 votes168 views10 answers
Python if string has spaces
Python
0 vote232 views1 answer
Pandas df represent a long column name with short name
Python
0 vote145 views1 answer
Summation django queryset
Python Django