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 vote366 views1 answer
Split a given number in python
Python
1 vote375 views2 answers
Django content type
Python
-1 vote334 views1 answer
Extract specific key values from python dictionary
Python
0 vote330 views1 answer
Blender change text during animation
Python
2 votes328 views2 answers
Spacy frenc hlemmatizer
Python
-1 vote345 views1 answer
Python key
Python
0 vote356 views1 answer
Pandas dataframe check for values more then a number
Python
0 vote351 views2 answers
Python bytes to dict
Python
0 vote375 views1 answer
Pandas earliest date in column
Python
0 vote354 views1 answer
Python aus liste tuple machen
Python