leetcode-5.1[136. 只出现一次的数字、122. 买卖股票的最佳时机 II、125. 验证回文串]（python实现)

题目1

题解1

class Solution:
    """
        时间复杂度: O(n^2)
        空间复杂度: O(n)
    """
    def singleNumber(self, nums: List[int]) -> int:
        temp = []
        for num in nums:
            if num in temp:
                temp.remove(num)
            else:
                temp.append(num)
        return temp[0]

    def singleNumber(self, nums: List[int]) -> int:
        """
            时间复杂度: O(n)
            空间复杂度: O(n)
        """
        from collections import Counter
        # 用Counter计算一个数组的元素个数并返回哈希表
        datas = Counter(nums)
        for data in datas.keys():
            if datas[data] == 1: 
                return data

附上题目链接

题目2

题解2

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        """
            贪心算法
        """
        profit = 0
        # 比较前后的获利多少，如果一直累加获利，相当于最低到最低 1-2-3-4  temp = 1  temp = 2 temp = 3
        for i in range(1, len(prices)):
            temp = prices[i] - prices[i - 1]
            if temp > 0: 
                profit += temp
        return profit
        
    def maxProfit(self, prices: List[int]) -> int:
        """
            动态规划
        """ 
        # input: A = [7,1,5,3,6,4]
        # 子问题: DP[i]为第i天时最大利润
        # 建立子问题间的关系：DP[i] = DP[i-1] + A[i] - A[i-1]
        #                             DP[i-1]
        # 边界条件: DP[0] = 0
        # 建表：
        #   i  0   1   2   3   4   5
        # A[i] 7   1   5   3   6   4
        #DP[i] 0   0   4   4   7   0
        n = len(prices)
        DP = [None]*n
        if n <= 0:
            return 0
        DP[0] = 0
        for i in range(1,n):
            DP[i] = DP[i-1] + prices[i] - prices[i-1] if prices[i] - prices[i-1] > 0 else DP[i-1]
        return DP[-1]

附上题目链接

题目3

题解3

class Solution:
    def isPalindrome(self, s: str) -> bool:
        snew = ''
        s = s.lower()
        for i in s:
            if i in 'abcdefghijklmnopqrstuvwxyz0123456789':
                snew = snew + i
        n = len(snew)
        if n <= 0:
            return True
        for i in range(n//2):
            if snew[i] != snew[n-i-1]:
                return False
        return True

附上题目链接