LeetCode.455 分发饼干
g.sort()
s.sort()
left = 0
for i in s:
if left >= len(g): break
if i >= g[left]:
left += 1
return left
LeetCode.376 摆动序列
prediff = 0
res = 1
for i in range(len(nums)-1):
curdiff = nums[i+1] - nums[i]
if curdiff * prediff <= 0 and curdiff:
prediff = curdiff
res += 1
return res
LeetCode.53 最大子数组和
res = nums[0]
for i in range(1, len(nums)):
nums[i] += max(nums[i-1], 0)
if nums[i] > res:
res = nums[i]
return res