LeetCode解题分享：1094. Car Pooling

最新推荐文章于 2022-06-27 10:20:34 发布

子为空

最新推荐文章于 2022-06-27 10:20:34 发布

阅读量674

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/DaVinciL/article/details/99482454

版权

LeetCode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

Problem

You are driving a vehicle that has capacity empty seats initially available for passengers. The vehicle only drives east (ie. it cannot turn around and drive west.)

Given a list of trips, trip[i] = [num_passengers, start_location, end_location] contains information about the i-th trip: the number of passengers that must be picked up, and the locations to pick them up and drop them off. The locations are given as the number of kilometers due east from your vehicle’s initial location.

Return true if and only if it is possible to pick up and drop off all passengers for all the given trips.

Example 1:

Input: trips = [[2,1,5],[3,3,7]], capacity = 4
Output: false

Example 2:

Input: trips = [[2,1,5],[3,3,7]], capacity = 5
Output: true

Example 3:

Input: trips = [[2,1,5],[3,5,7]], capacity = 3
Output: true

Example 4:

Input: trips = [[3,2,7],[3,7,9],[8,3,9]], capacity = 11
Output: true

Constraints:

trips.length <= 1000
trips[i].length == 3
1 <= trips[i][0] <= 100
0 <= trips[i][1] < trips[i][2] <= 1000
1 <= capacity <= 100000

解题思路

题目的本质含义是一个优先队列的题目，在队列中，队首的元素始终是最早下车的乘客们。可以使用优先队列的地方，往往也可以使用排序，但是时间上会有一定的损失。
代码如下：

class BusStop
{
public:
	int station;
	int people;

	BusStop(int s, int p) :station(s), people(p) {}

	bool operator<(const BusStop bs) const
	{
		return this->station > bs.station;
	}
};

class Solution {
public:
	bool carPooling(vector<vector<int>>& trips, int capacity) {
		priority_queue<BusStop> q;
		sort(trips.begin(), trips.end(), [](vector<int> a, vector<int> b) {return a[1] < b[1]; });
		int empty = capacity;

		for (auto t : trips)
		{
			while (q.size() > 0 && q.top().station <= t[1])
			{
				empty += q.top().people;
				q.pop();
			}

			if (empty < t[0])
			{
				return false;
			}

			empty -= t[0];
			q.push(BusStop(t[2], t[0]));
		}
		return true;
	}
};