【leetcode】---数组题目【python】

26.Remove duplicate from Sorted Array

思路：题目不允许开辟新空间，且数组排好序。若nums[i]==nums[index-1]，增加i去避免复制。当nums[i]!=nums[index-1]，此时进行复制，且让index+1，重复操作直至i达到len（nums）

class Solution:
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums)==0:
            return 0
        index = 1
        for i in range(1,len(nums)):
            if nums[i] != nums[index-1]:  #找出与nums[index-1]不相等的数组下标i
                nums[index]=nums[i]    #不同值赋值给num[index]
                index += 1       #此处index+1便于下次赋值，恰好为不重复数组长度
        return index

80.Remove Depulicates from Sorted Array II

思路：同上，重点在于改成判断nums[i]与nums[index-2]

class Solution:
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums)<=2:
            return len(nums)
        index = 2
        for i in range(2,len(nums)):
            if nums[i]!=nums[index-2]:
                nums[index] = nums[i]
                index +=1
        return index

思路一：暴力破解

思路二：先排序

思路三：去掉重复元素

class Solution:
    def longestConsecutive(self, nums):
        """
        方法一：暴力破解，遍历nums，记录current_nums比其值大的连续数，比较当前最长连续数，返回最大的。
		时间复杂度O(n^3)空间复杂度O(1)
        :type nums: List[int]
        :rtype: int
        """
        longest_streak = 0
        for num in nums:  # 可直接通过数，考虑通过索引
            current_num = num
            count = 1
            while current_num + 1 in nums:
                count += 1
                current_num += 1
            longest_streak = max(longest_streak, count)
        return longest_streak

    def longestConsecutive(self, nums):

    """
    方法二：先排序，判断当前num[i]值是否与num[i+1]相等，相等则i后移。不相等则判断num[i]+1是否等于nums[i+1]
    相等则说明连续，count+1，不相等重置count，记录最长连续数。
    返回最长连续数
    时间复杂度O(nlgn)空间复杂度O(1) or O(n)
    """
        if len(nums) == 0:
            return 0
        nums.sort()
        longest_streak = 1
        count = 1
        for i in range(len(nums) - 1):
            if nums[i + 1] != nums[i]:
                if nums[i + 1] == nums[i] + 1:
                    count += 1
                else:
                    longest_streak = max(longest_streak, count)
                    count = 1
        return max(longest_streak, count)


    def longestConsecutive(self, nums):
    """
    方法三：去掉nums中重复数，找出连续数中最大的那个数,若curretn_num-1仍在set(nums)中，count++，返回最长连续数
    返回最长连续数
    时间复杂度O(n)空间复杂度O(n)
    """
        nums_set = set(nums)
        longest_streak = 0
        for num in nums_set:
            if num + 1 not in nums_set:
                current_num = num
                count = 1
                while current_num - 1 in nums_set:
                    current_num -= 1
                    count += 1
                longest_streak = max(longest_streak, count)
        return longest_streak
    # 参考链接：https://leetcode.com/articles/longest-consecutive-sequence/