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

2 votes319 views1 answer
Best free rat for windows
Python
0 vote363 views1 answer
How to use str()
Python
0 vote324 views1 answer
1: for python position
Python
0 vote351 views1 answer
Watershed Segmentation
Python
0 vote315 views1 answer
Vehari weather
Python
-1 vote350 views1 answer
Python Loop Usage
Python
0 vote331 views2 answers
Popups in tkinter
Python
0 vote359 views1 answer
Python PyDrive service account credentials
Python
1 vote305 views1 answer
Run code with different verions of python
Python
0 vote320 views1 answer
Strategy forex with python
Python