yys130826的博客

class Solution: def findMinArrowShots(self, points: List[List[int]]) -> int: if len(points)==0: return 0 points.sort(key=lambda x:x[0])#和根据身高还有分发糖果一个类型，先按照第一个元素排序。 res=1#最少也需要一次才可以全部引爆。 for i in range(1,l.

class Solution: def lemonadeChange(self, bills: List[int]) -> bool: if bills[0]==10 or bills[0]==20: return False cnt5=0 cnt10=0 cnt20=0 for i in range(len(bills)): if bills[i]==5: .

class Solution: def candy(self, ratings: List[int]) -> int: n=len(ratings) candyval=[1]*n for i in range(1,n): if ratings[i]>ratings[i-1]: candyval[i]=candyval[i-1]+1 for i in range(n-2.

class Solution: def canCompleteCircuit(self, gas: List[int], cost: List[int]) -> int: if sum(gas)<sum(cost): return -1 index=0 res=0 for i in range(len(gas)): res+=gas[i]-cost[i] .

class Solution: def largestSumAfterKNegations(self, nums: List[int], k: int) -> int: nums=sorted(nums,key=abs,reverse=True)#一定要按绝对值大小排序。且是降序，方便处理k＞负数个数的情况。 for i in range(len(nums)): if k>0 and nums[i]<=0:#当k＞0且遇到的.

class Solution: def canJump(self, nums: List[int]) -> bool: if len(nums)==1:#只有一个是可以到达的。 return True cover=0 i=0 while i<=cover:#因为cover是动态变化的，for不支持，所以改用while cover=max(i+nums[i],cover) .

class Solution: def maxProfit(self, prices: List[int]) -> int: res=0 for i in range(len(prices)-1): earn=prices[i+1]-prices[i] if earn>0: res+=earn return res '''贪心在，我们只需要把整个时间拆.

class Solution: def maxSubArray(self, nums: List[int]) -> int: if len(nums)==1: return nums[0] count=0 res=-2**32 for i in range(len(nums)): count+=nums[i] # 如果当前统计结果比我们之前记录的最大值res.

class Solution: def wiggleMaxLength(self, nums: List[int]) -> int: if len(nums)<=1: return len(nums) curdif=0 predif=0 res=1 for i in range(len(nums)-1): curdif=nums[i+1]-nums[i] .

class Solution: def findContentChildren(self, g: List[int], s: List[int]) -> int: #排序 g=sorted(g) s=sorted(s) res=0#记录最后的数 if not s : return 0 index=len(s)-1#从后往前遍历 for i in range(.