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

-2 votes286 views2 answers
String index
Python
0 vote284 views1 answer
Scipy version check
Python
3 votes308 views2 answers
What is indentation in python
Python
0 vote282 views4 answers
Django-sslserver · PyPI
Python
4 votes321 views2 answers
Python read array line by line
Python
0 vote289 views1 answer
Ipython widget display
Python
6 votes265 views2 answers
Merge list elements python
Python
0 vote296 views1 answer
Python get stock prices
Python
0 vote284 views1 answer
Python requests ignore SSL
Python
1 vote288 views2 answers
Python does string contain space
Python