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 vote290 views1 answer
Python quiet future warning
Python
0 vote186 views1 answer
Calculate the R^2 for X and Y python
Python
0 vote172 views1 answer
Networkx - remove small components from a graph
Python
1 vote208 views1 answer
Formatting Dates
Python
2 votes167 views2 answers
Pypi
Python
0 vote169 views1 answer
Def areEquallyStrong(yourLeft, yourRight, friendsLeft, friendsRight):python execution
Python
0 vote159 views1 answer
Get array from h5py dataset
Python
0 vote144 views1 answer
Unique combinations python
Python
0 vote196 views1 answer
How to wait for loading icon to disappear from the page using selenium python
Python
3 votes168 views2 answers
How to get key value in nested dictionary python
Python