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

38 votes106 views2 answers
Python extract thefile name from relative path
Python
1 vote101 views2 answers
Organize order columns dataframe
Python
0 vote115 views1 answer
How to display percentage in pandas crosstab
Python
0 vote125 views1 answer
Qlcdnumber set value python
Python
0 vote68 views1 answer
"api_view" is not defined django
Python
0 vote148 views1 answer
Flask windows auto reload
Python Flask
0 vote134 views1 answer
"must be called with either an object pk or a slug in the URLconf"
Python
0 vote95 views1 answer
Assigning a value to a character in string or text file in python
Python
1 vote113 views3 answers
Python solve linear equation system
Python
0 vote111 views2 answers
Count specific instances in a columb in pandas
Python