Python每日一练(20230414) 买卖股票最佳时机III、成绩分布、分割回文串

from typing import List
class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if len(prices) == 0:
            return 0
        k = 2
        n = len(prices)
        dp_i_1_0 = 0
        dp_i_1_1 = -prices[0]
        dp_i_2_0 = 0
        dp_i_2_1 = -prices[0]
        for i in range(1, n):
            dp_i_1_0 = max(dp_i_1_0, dp_i_1_1 + prices[i])
            dp_i_1_1 = max(dp_i_1_1, -prices[i])
            dp_i_2_0 = max(dp_i_2_0, dp_i_2_1 + prices[i])
            dp_i_2_1 = max(dp_i_2_1, dp_i_1_0 - prices[i])
        return dp_i_2_0
#%%
s = Solution()
prices = [3,3,5,0,0,3,1,4]
print(s.maxProfit(prices))
prices = [1,2,3,4,5]
print(s.maxProfit(prices))
prices = [7,6,4,3,1]
print(s.maxProfit(prices))
prices = [1]
print(s.maxProfit(prices))

import random
a=[]
sum=0
cnt=0
for i in range(10):
    x=random.randint(0,100)
    sum+=x
    print(x,end=" ")
    a.append(x)
ave=sum/10
print()
print(ave)
for i in range(10):
    if a[i]>ave:
        cnt+=1
print(cnt)

from typing import List
class Solution(object):
    def partition(self, s):
        """
        :type s: str
        :rtype: List[List[str]]
        """
        if len(s) == 0:
            return []
        else:
            res = []
            self.dividedAndsel(s, [], res)
        return res
    def dividedAndsel(self, s, tmp, res):
        if len(s) == 0:
            res.append(tmp)
        for i in range(1, len(s) + 1):
            if s[:i] == s[:i][::-1]:
                self.dividedAndsel(s[i:], tmp + [s[:i]], res)
#%%
sol = Solution()
s = 'aab'
print(sol.partition(s))
s = 'a'
print(sol.partition(s))