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 vote195 views1 answer
How to add list as a column to dataframe
Python
0 vote194 views1 answer
Selenium save page as image
Python
9 votes185 views4 answers
Python combinations function
Python
0 vote213 views1 answer
Python __repr__ meaning
Python
39 votes201 views6 answers
Pandas print all columns
Python
1 vote209 views1 answer
Django filter by category
Python Django
0 vote205 views1 answer
List Comprehension iteration
Python
43 votes223 views6 answers
Remove char from string
Python
3 votes176 views2 answers
How to add numbers into a list python
Python
10 votes198 views1 answer
Pandas sample seed
Python