LeetCode - Array - Easy - Python3 - unfinished

 

 

1. Two Sum

Description：

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

Solution：

Approach 1: Brute Force

class Solution:
    def twoSum(self, nums, target):
        res = []
        l = len(nums)
        for i in range(0,l-1):
            for j in range(i+1, l):
                if nums[i]+nums[j] == target:
                    res.append(i)
                    res.append(j)
                    return res
                    break

'''
Runtime: 5256 ms
Your runtime beats 21.66 % of python3 submissions.
Memory Usage: 13.7 MB
Your memory usage beats 85.02 % of python3 submissions.
'''

Approach 2: Two-pass Hash Table

class Solution:
    def twoSum(self, nums, target):
        dic = {}
        l = len(nums)
        for num in nums:
            dic[num] = nums.index(num)
        for i in range(l):
            tmp = target - nums[i]
            if tmp in dic and dic[tmp] != i:
                return [i,dic[tmp]]

'''
Runtime: 652 ms
Your runtime beats 38.07 % of python3 submissions.
Memory Usage: 14.9 MB
Your memory usage beats 11.38 % of python3 submissions.
'''

Approach 3: One-pass Hash Table

class Solution:
    def twoSum(self, nums, target):
        dic = {}
        l = len(nums)
        for i in range(l):
            tmp = target - nums[i]
            if tmp in dic:
                return [dic[tmp], i]
            dic[nums[i]] = i

'''
Runtime: 32 ms
Your runtime beats 98.46 % of python3 submissions.
Memory Usage: 14.3 MB
Your memory usage beats 38.17 % of python3 submissions.
'''

 

 

26. Remove Duplicates from Sorted Array

Description: 

Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

Example 1:

Given nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn't matter what values are set beyond the returned length.

Solution: 

Approach 1: 

class Solution:
    def removeDuplicates(self, nums):
        nums[:] = sorted(list(set(nums)))
        return len(nums)

'''
Runtime: 56 ms
Your runtime beats 93.55 % of python3 submissions.
Memory Usage: 14.9 MB
Your memory usage beats 16.42 % of python3 submissions.
'''

Appraoch 2:

class Solution:
    def removeDuplicates(self, nums):
        if len(nums) == 0:
            return 0
        else:
            i = 0
            for j in range(1,len(nums)):
                if nums[j] != nums[i]:
                    i = i+1
                    nums[i] = nums[j]
            return i+1

'''
Runtime: 52 ms
Your runtime beats 97.95 % of python3 submissions.
Memory Usage: 15 MB
Your memory usage beats 11.70 % of python3 submissions.
'''

 

 

27. Remove Element

Description：

Given an array nums and a value val, remove all instances of that value in-place and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

Example 1:

Given nums = [3,2,2,3], val = 3,

Your function should return length = 2, with the first two elements of nums being 2.

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,1,2,2,3,0,4,2], val = 2,

Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.

Note that the order of those five elements can be arbitrary.

It doesn't matter what values are set beyond the returned length.

Solution:

Approach 1:

class Solution:
    def removeElement(self, nums, val):
        i = 0
        for j in range(0, len(nums)):
            if nums[j] != val:
                nums[i] = nums[j]
                i = i+1
        return i

'''
Runtime: 36 ms
Your runtime beats 87.93 % of python3 submissions.
Memory Usage: 13.2 MB
Your memory usage beats 49.66 % of python3 submissions.
'''

Approach 2: 

class Solution:
    def removeElement(self, nums, val):
        i = 0
        n = len(nums)
        while i < n:
            if nums[i] == val:
                nums[i] = nums[n-1]
                n = n-1
            else:
                i = i+1
        return n

'''
Runtime: 36 ms
Your runtime beats 87.93 % of python3 submissions.
Memo