初级算法 数组

def distinct(index, alist):

    if index < 0:

        print(alist, len(alist))

        return alist

    if alist[index] in alist[index+1:]:

        alist.pop(index)

    distinct(index-1, alist)

distinct(len(alist) - 1, alist)

class Solution(object):

    def removeDuplicates(self, nums):

        """

        :type nums: List[int]

        :rtype: int

        """

        for index in range(len(nums)-1,-1,-1):

            print(index)

            if nums[index] in nums[index+1:]:

                nums.pop(index)

        return len(nums)

Solution().removeDuplicates([1,1,2])

# 买卖股票的最佳时间

class Solution(object):

    def maxProfit(self, prices):

        """

        :type prices: List[int]

        :rtype: int

        """

        max = 0 

        for index in range(len(prices)-1):

            print(index)

            if prices[index] < prices[index+1]:

                max += prices[index+1] - prices[index]

        return max

Solution().maxProfit([7,1,5,3,6,4])

# 存在重复

def exist_duplicate(alist):

    for index in range(1, len(alist)):

        if alist[index] in alist[0:index]:

            return True

    return False

exist_duplicate([1,2,3,4,4])