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

4 votes270 views1 answer
Loca value and drop pandas dataframe
Python
0 vote283 views1 answer
Take union of two dataframes pandas
Python
0 vote290 views1 answer
Get all subsets of a list python
Python
1 vote284 views2 answers
Split a string with 2 char each in python
Python
1 vote249 views1 answer
Filter with different operator in django
Python
0 vote277 views3 answers
Names of all methods in class introspect pythonm
Python
3 votes263 views1 answer
Tensot to numpy pytorch
Python
0 vote281 views1 answer
Python remove file with pattern
Python
0 vote244 views1 answer
Rest api error
Python
33 votes277 views5 answers
Python exit program
Python