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

13 votes333 views6 answers
Python tkinter
Python
10 votes319 views1 answer
Format fecimal in f string py
Python
0 vote305 views1 answer
Email python library get all messages
Python
3 votes283 views1 answer
Print items in object python
Python
0 vote314 views1 answer
Procfile for django heroku
Python Django
2 votes312 views2 answers
Get a liste from a txt file python
Python
0 vote312 views3 answers
How to catch ctrl c in python
Python
0 vote305 views1 answer
Python print \n every n loops
Python
0 vote298 views1 answer
Pandas and operator
Python
0 vote279 views1 answer
Repeat a condition n times one by one python
Python