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 vote146 views2 answers
Django APIView Pagination
Python
5 votes158 views2 answers
Python link shortener
Python
9 votes169 views2 answers
Django app
Python
0 vote165 views2 answers
Apply butterworth filter python
Python
0 vote114 views1 answer
Pandas code
Python
4 votes152 views2 answers
Empty array python
Python
0 vote146 views1 answer
Python alfabet
Python
1 vote151 views1 answer
Import mean squared log error
Python
0 vote159 views2 answers
Allow x_frame_options django
Python
0 vote158 views1 answer
Change a color on touch roblox
Python