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

12 votes299 views1 answer
How to create an env to use in vs code using anaconda
Python
3 votes342 views1 answer
Spam python
Python
0 vote302 views1 answer
Pandas set column to value using mask
Python
0 vote314 views1 answer
Print("python is good")
Python
0 vote348 views1 answer
Flask server not reloading
Python Flask
0 vote306 views1 answer
Group by, aggregate multiple column -pandas
Python
0 vote338 views2 answers
Install python in centos7
Python
1 vote334 views5 answers
Numpy argsort
Python
1 vote309 views3 answers
Python is float function
Python
0 vote335 views1 answer
Python sort a 2d array by custom function
Python