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 vote91 views1 answer
Python discover methods of object/module
Python
0 vote94 views1 answer
Python tkinter fenstergröße
Python
1 vote111 views1 answer
Datetime not defined python
Python
1 vote118 views1 answer
Create age-groups in pandas
Python
9 votes93 views3 answers
Remove dict python
Python
0 vote101 views1 answer
Write Python programs to print numbers from 1 to 10000 while loops
Python
0 vote121 views1 answer
Best fit line python log log scale
Python
0 vote90 views1 answer
Django import excel file from same directory
Python
4 votes101 views2 answers
Python code formatter vs code
Python
2 votes104 views1 answer
Check corently installed epython version
Python