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 vote150 views1 answer
Matplotlib scatter increase marker size
Python
1 vote138 views1 answer
Kaaba python tutorial
Python
2 votes127 views1 answer
Test_size
Python
0 vote152 views1 answer
Popup flutter
Python
0 vote145 views1 answer
Subprocess ffmpeg x265 codec
Python
0 vote146 views2 answers
Adding labels to histogram bars in matplotlib
Python
2 votes138 views1 answer
When opening a file in python what does w mean
Python
1 vote142 views1 answer
Program to segregate positive and negative numbers in same list
Python
12 votes278 views6 answers
Python flask
Python Flask
0 vote163 views1 answer
Fibonacci numbers function python print
Python