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 vote169 views1 answer
Django cms api
Python
1 vote164 views3 answers
Flatmap python
Python
0 vote113 views1 answer
How to run a yaml file
Python
4 votes157 views4 answers
Pandas rename specific column
Python
4 votes222 views2 answers
How to make django model field case insensitive
Python Django
0 vote202 views1 answer
Csgo force crosshair on sniper python
Python
0 vote172 views2 answers
Python verifier qu'un string est un chiffre
Python
5 votes183 views3 answers
Ros python publisher
Python
0 vote165 views1 answer
Can't import flask login
Python
0 vote173 views1 answer
Django queryset last 10
Python