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 vote240 views1 answer
Import folder from another folder python
Python
1 vote251 views1 answer
Instal cython
Python
0 vote252 views1 answer
Python .on event triggers
Python
2 votes233 views1 answer
How to get the last value in a list python
Python
0 vote283 views1 answer
Tkiner lable
Python
3 votes208 views2 answers
Plot bounds python
Python
5 votes258 views1 answer
Install requirment.txt
Python
12 votes247 views6 answers
Python flask
Python
0 vote255 views1 answer
Dataframe show to semicolon python
Python
0 vote242 views1 answer
Float number field django models
Python