数据结构刷题

一、存在重复元素（Python哈希表解法）

class Solution:
    def containsDuplicate(self, nums: List[int]) -> bool:
        hashtable = dict()
        k = len(nums)
        for i in range(0,k):
            if nums[i] in hashtable:
                return True
            hashtable[nums[i]]=i
        return False

二、两数之和（Python哈希表解法）

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        hashtable=dict()
        for i,num in enumerate(nums):
            if target-num in hashtable:
                return [hashtable[target-num],i]
            hashtable[nums[i]]=i
        return []

三、最大子数组和

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        maxsum = nums[0]
        pre = 0
        l = len(nums)
        for i in range(0,l):
            pre = max(pre+nums[i],nums[i])
            maxsum = max(maxsum,pre)
        return maxsum

四、合并两个有序数组

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        """
        Do not return anything, modify nums1 in-place instead.
        """
        nums1[m:] = nums2
        nums1.sort()