LeetCode: 871. Minimum Number of Refueling Stops

題目描述

A car travels from a starting position to a destination which is target miles east of the starting position.

Along the way, there are gas stations. Each station[i] represents a gas station that is station[i][0] miles east of the starting position, and has station[i][1] liters of gas.

The car starts with an infinite tank of gas, which initially has startFuel liters of fuel in it. It uses 1 liter of gas per 1 mile that it drives.

When the car reaches a gas station, it may stop and refuel, transferring all the gas from the station into the car.

What is the least number of refueling stops the car must make in order to reach its destination? If it cannot reach the destination, return -1.

Note that if the car reaches a gas station with 0 fuel left, the car can still refuel there. If the car reaches the destination with 0 fuel left, it is still considered to have arrived.

Example 1:

Input: target = 1, startFuel = 1, stations = [] Output: 0 Explanation: We can reach the target without refueling.

Example 2:

Input: target = 100, startFuel = 1, stations = [[10,100]] Output: -1 Explanation: We can't reach the target (or even the first gas station).

Example 3:

Input: target = 100, startFuel = 10, stations = [[10,60],[20,30],[30,30],[60,40]] Output: 2 Explanation: We start with 10 liters of fuel. We drive to position 10, expending 10 liters of fuel. We refuel from 0 liters to 60 liters of gas. Then, we drive from position 10 to position 60 (expending 50 liters of fuel), and refuel from 10 liters to 50 liters of gas. We then drive to and reach the target. We made 2 refueling stops along the way, so we return 2.

Note:

1 <= target, startFuel, stations[i][1] <= 10^9 0 <= stations.length <= 500 0 < stations[0][0] < stations[1][0] < ... < stations[stations.length-1][0] < target

解題思路 —— 動態(tài)規(guī)劃

記 dp[i] 為到達(dá)當(dāng)前站點(diǎn)加氣 i 次 的最大氣量（包括已經(jīng)用過的）。
若當(dāng)前站點(diǎn)，沒加氣則，dp[i] = dp[i](后者是到達(dá)前一個站點(diǎn)加氣 i 次的最大氣量)；
若當(dāng)前站點(diǎn)加氣，則，dp[i] = dp[i-1]+station[i][1]（dp[i-1] 是到達(dá)前一個站點(diǎn)加氣 i-1 次的最大氣量）。

AC 代碼

class Solution { public:int minRefuelStops(int target, int startFuel, vector<vector<int>>& stations) {// dp[i]： 到達(dá)當(dāng)前站，加油 i 次 的最大氣量int dp[504]= { startFuel };stations.push_back({target, 0});for(int i = 1; i <= stations.size(); ++i){dp[i] = -1;}for(size_t i = 0; i < stations.size(); ++i){for(int j = i+1; j >= 0; --j){int maxFuel = -1;// 第 i 站不加氣if(dp[j] >= stations[i][0]){maxFuel = max(maxFuel, dp[j]);}// 第 i 站加氣if(j > 0 && dp[j-1] >= stations[i][0]){maxFuel = max(maxFuel, dp[j-1] + stations[i][1]);}dp[j] = maxFuel;}}for(int i = 0; i <= stations.size(); ++i){if(dp[i] != -1) return i;}return -1;} };

總結(jié)

以上是生活随笔為你收集整理的LeetCode: 871. Minimum Number of Refueling Stops的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。