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 votes186 views2 answers
Python fibonacci while loop
Python
1 vote129 views1 answer
Flask authentication user without database
Python
1 vote150 views1 answer
Python zip extract directory
Python
17 votes142 views2 answers
Two loop type python
Python
0 vote130 views1 answer
Insert video in tkinter
Python
31 votes122 views6 answers
Try except
Python
0 vote145 views1 answer
H2o dataframe columns drop
Python
0 vote141 views1 answer
Python tkinter cursor types
Python
71 votes131 views6 answers
Alphabet list python
Python
0 vote131 views1 answer
Problem with console writeline python
Python