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 vote190 views1 answer
Copy data with tensroflow io
Python
4 votes212 views3 answers
Read dict txt python
Python
32 votes181 views3 answers
Dotenv python
Python
6 votes180 views2 answers
Numpy from csv
Python
2 votes204 views1 answer
Filter by row contains pandas
Python
52 votes184 views2 answers
Python - remove duplicate items from the list
Python
0 vote183 views1 answer
Google translator api pyhton
Python
37 votes282 views4 answers
Python To find the sum of all the elements in a list.
Python
5 votes191 views3 answers
Converting string array to int array python
Python
0 vote221 views1 answer
''' python '''
Python