[leetcode] car-pooling 拼车
class Solution {
public:
bool carPooling(vector<vector<int>>& trips, int capacity) {
int to_max = 0;
for (const auto& trip: trips) {
to_max = max(to_max, trip[2]);
}
vector<int> diff(to_max + 1);
for (const auto& trip: trips) {
diff[trip[1]] += trip[0];
diff[trip[2]] -= trip[0];
}
int count = 0;
for (int i = 0; i <= to_max; ++i) {
count += diff[i];
if (count > capacity) {
return false;
}
}
return true;
}
};
原文地址：https://blog.csdn.net/xiaocong1990/article/details/140316936
免责声明：本站文章内容转载自网络资源，如本站内容侵犯了原著者的合法权益，可联系本站删除。更多内容请关注自学内容网（zxcms.com）！