C2575的博客

https://leetcode-cn.com/problems/pascals-triangle/ class Solution: def generate(self, numRows: int) -> List[List[int]]: result = [] for i in range(numRows): d= [1]*(i+1) if i >=2: f.

https://leetcode-cn.com/problems/maximum-subarray/ class Solution: def maxSubArray(self, nums: list[int]) -> int: if len(nums) <=1: return sum(nums) vs = [0]*len(nums) vs[0]= nums[0] result = num.

https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/ class Solution: def maxProfit(self, prices: List[int]) -> int: if len(prices)<=1: return 0 minp,maxp = prices[0],0 for p in prices[1:]:.

https://leetcode-cn.com/contest/weekly-contest-260/problems/maximum-difference-between-increasing-elements/ GitHub - w5678/leetcode-2021: Learn and Share class Solution: def maximumDifference(self, nums: list[int]) -> int: maxdiff =

https://github.com/w5678/leetcode-2021https://github.com/w5678/leetcode-2021力扣 class Solution: def reversePrefix(self, word: str, ch: str) -> str: idx = word.find(ch) return word if idx== -1 else word[0:idx+1][::-1]+ wor...

https://leetcode-cn.com/problems/count-number-of-homogenous-substrings/https://leetcode-cn.com/problems/count-number-of-homogenous-substrings/https://github.com/w5678/leetcode-2021https://github.com/w5678/leetcode-2021 class Solution: def countHomo

我的题解： class Solution: def minOperations(self, s: str) -> int: return min(self.startWith1(s),self.startWith0(s)) def startWith1(self,s:str) -> int: i,cnt=0,0 key=0 maps={ 1:"1", 0:"...