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 vote279 views4 answers
Flask documentation
Python Flask
0 vote102 views1 answer
Python loop break on keypress
Python
3 votes103 views1 answer
How to make a empty folder using os in pyhon
Python
8 votes112 views1 answer
Remove too short strings from a list python
Python
0 vote126 views3 answers
How to remove vowels from a string in python
Python
0 vote105 views1 answer
Bytestring python
Python
59 votes111 views6 answers
Class in python
Python
0 vote103 views1 answer
Zscore python
Python
0 vote113 views1 answer
Pyspark rdd sort by value descending
Python
0 vote115 views1 answer
Créer un dict python avec une liste
Python