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

61 votes272 views6 answers
Python get dir
Python
0 vote321 views1 answer
Username__icontains in django
Python Django
4 votes273 views4 answers
How to create a calculator in python
Python
1 vote337 views1 answer
Python print no end of line
Python
3 votes252 views9 answers
Creating environment variable in python
Python
1 vote277 views1 answer
Python install pandas for linux
Python
1 vote280 views1 answer
How to convert adjacency list to adjacency matrix
Python
6 votes268 views2 answers
Convert negative to positive in python
Python
2 votes287 views2 answers
Flask hello world get
Python Flask
0 vote291 views1 answer
Pytorch pad to square
Python