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 vote263 views1 answer
Python close gile
Python
0 vote219 views2 answers
If something in something python example
Python
0 vote261 views1 answer
Selenium press tab python
Python
2 votes252 views3 answers
Pair plot python
Python
0 vote211 views1 answer
Check prime number in python
Python
1 vote221 views1 answer
New column with age interval pandas
Python
1 vote253 views1 answer
Pyqt5 qlineedit on change
Python
0 vote240 views1 answer
Django create view class
Python Django
0 vote220 views1 answer
Statsmodels fitted values
Python
92 votes240 views5 answers
Make a new environment conda
Python