# 代码随想录训练营第III期--035--python
# 860.柠檬水找零
class Solition:
def lemonadeChange(self, bills: List[int]) -> bool:
five, ten = 0, 0
for bill in bills:
if bill == 0:
five += 1
elif bill == 10:
if five < 1: return False
five -= 1
ten += 1
else:
if ten > 0 and five > 0:
ten -= 1
five -= 1
elif five > 2:
five -= 3
else: return False
return True
# 406.根据身高重建队列
def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
people.sort(key = lambda x:(-x[0], x[1]))
que = []
for q in people:
que.insert(q[1], q)
return que
# 452. 用最少数量的箭引爆气球
def findMinArrowShots(self, points: List[List[int]]) -> int:
points.sort(key = lambda x: x[1])
pos = points[0][1]
res = 1
for p in points:
if i[0] > pos:
res += 1
pos = p[1]
return res
代码随想录训练营第III期--035--python
最新推荐文章于 2024-07-23 14:36:35 发布