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 vote158 views1 answer
Sqlalchemy if a value in list of values
Python
0 vote114 views2 answers
Most efficient fibonacci number algorithm
Python
0 vote126 views1 answer
Tensorflow loop csdn
Python
3 votes123 views1 answer
Python docker
Python
2 votes133 views1 answer
Find all color in image python
Python
0 vote210 views1 answer
Custom auth django channels
Python Django
7 votes132 views2 answers
Make pandas df from np array
Python
0 vote128 views1 answer
Aws lambda logging with python logging library
Python
7 votes127 views2 answers
Python: remove duplicate in a specific column
Python
4 votes128 views1 answer
To_csv without index
Python