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

0 vote204 views1 answer
Python get all items from generator
Python
0 vote214 views1 answer
How to use startswith() with list
Python
3 votes235 views1 answer
Join two set in python
Python
17 votes206 views3 answers
ImportError: No module named _tkinter, please install the python-tk package
Python
0 vote174 views1 answer
Print Odd Even Negative Integer Count
Python
1 vote224 views2 answers
What is tensorflow in python
Python
1 vote231 views5 answers
Convert html to python
Python
1 vote222 views1 answer
Check how many times a substring appears in a string
Python
0 vote207 views1 answer
Clone keras model
Python
0 vote222 views1 answer
Save a seaborn heatmap
Python