class Solution:
def carPooling(self, trips: List[List[int]], capacity: int) -> bool:
nums = [0]*1001
for num,start,end in trips:
nums[start] +=num
nums[end]-=num
if(nums[0]>capacity):
return False
for i in range(1,1001):
nums[i]+=nums[i-1]
if(nums[i]>capacity):
return False
return True
类似题目
更多题目查看阿明的整理
LeetCode 1109. 航班预订统计(差分思想)_Michael是个半路程序员-CSDN博客_leetcode 差分算法