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

6 votes350 views5 answers
Django logout
Python
1 vote324 views1 answer
How to convert int in python
Python
7 votes328 views2 answers
Append record in csv
Python
2 votes329 views1 answer
How to replace a word in csv file using python
Python
0 vote340 views1 answer
How to make a label in python
Python
0 vote341 views1 answer
Rotate an image python keras
Python
0 vote337 views1 answer
Python returning rows and columns from a matrix string
Python
0 vote356 views1 answer
Django user refistration
Python Django
0 vote320 views1 answer
Puppy and sum codechef solution
Python
14 votes337 views2 answers
How to change values in dataframe python
Python