LeetCode刷題：871. Minimum Number of Refueling Stops

原題鏈接：https://leetcode.com/problems/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

汽車從起點(diǎn)出發(fā)駛向目的地，該目的地位于出發(fā)位置東面 target 英里處。

沿途有加油站，每個(gè) station[i] 代表一個(gè)加油站，它位于出發(fā)位置東面 station[i][0] 英里處，并且有 station[i][1] 升汽油。

假設(shè)汽車油箱的容量是無限的，其中最初有 startFuel 升燃料。它每行駛 1 英里就會用掉 1 升汽油。

當(dāng)汽車到達(dá)加油站時(shí)，它可能停下來加油，將所有汽油從加油站轉(zhuǎn)移到汽車中。

為了到達(dá)目的地，汽車所必要的最低加油次數(shù)是多少？如果無法到達(dá)目的地，則返回 -1 。

注意：如果汽車到達(dá)加油站時(shí)剩余燃料為 0，它仍然可以在那里加油。如果汽車到達(dá)目的地時(shí)剩余燃料為 0，仍然認(rèn)為它已經(jīng)到達(dá)目的地。

?

示例 1：

輸入：target = 1, startFuel = 1, stations = []
輸出：0
解釋：我們可以在不加油的情況下到達(dá)目的地。
示例 2：

輸入：target = 100, startFuel = 1, stations = [[10,100]]
輸出：-1
解釋：我們無法抵達(dá)目的地，甚至無法到達(dá)第一個(gè)加油站。
示例 3：

輸入：target = 100, startFuel = 10, stations = [[10,60],[20,30],[30,30],[60,40]]
輸出：2
解釋：
我們出發(fā)時(shí)有 10 升燃料。
我們開車來到距起點(diǎn) 10 英里處的加油站，消耗 10 升燃料。將汽油從 0 升加到 60 升。
然后，我們從 10 英里處的加油站開到 60 英里處的加油站（消耗 50 升燃料），
并將汽油從 10 升加到 50 升。然后我們開車抵達(dá)目的地。
我們沿途在1兩個(gè)加油站停靠，所以返回 2 。

---

算法設(shè)計(jì)

package com.bean.algorithm.basic;public class LeetCode871 {/** 動(dòng)態(tài)規(guī)劃算法* dp[i][j]代表在station[i]剩余汽油量為j* 我們把起點(diǎn)0作為第一個(gè)加油站 * 這時(shí)，dp[0][0]=startFuel* 初始化 dp[i][j]=-1， 表示我們使用j油量時(shí)不能達(dá)到station[i].* 狀態(tài)方程為* remain=dp[i][j]+station[i][0]-station[i+1][0]* 如果 remain>0, 有兩種情況:* 無燃油時(shí), dp[i+1][j]=max(dp[i+1][j], remain)* 有燃油時(shí), dp[i+1][j+1]=max(dp[i+1][j+1], remain+station[i+1][1])* 針對每一對（i，j），檢查條件 dp[i][j]+station[i][0]>=target, * 然后返回滿足條件的最小的j值.* * */public int minRefuelStops(int target, int startFuel, int[][] stations) {int ret = 10000;int N = stations.length;int dp[][] = new int[N + 1][N + 1];for (int i = 0; i < N + 1; i++) {for (int j = 0; j < N + 1; j++) {dp[i][j] = -1;}}//初始設(shè)定從0號開始,油量為0。dp[0][0] = startFuel;for (int i = 0; i < N + 1; i++) {for (int j = 0; j < N + 1; j++) {if (dp[i][j] + (i >= 1 ? stations[i - 1][0] : 0) - target >= 0) {ret = Math.min(ret, j);}if (i < N) {int remain = dp[i][j] + (i >= 1 ? stations[i - 1][0] : 0) - stations[i][0];if (remain >= 0) {dp[i + 1][j] = Math.max(dp[i + 1][j], remain);dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], remain + stations[i][1]);}}}}return ret >= 10000 ? -1 : ret;}public static void main(String[] args) {// TODO Auto-generated method stub/** Input: target = 100, startFuel = 10, stations = [[10,60],[20,30],[30,30],[60,40]]* Output: 2* 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.* */int target = 100;int startFuel = 10;int[][] stations =new int[][] {{10,60},{20,30},{30,30},{60,40}};LeetCode871 leetcode871=new LeetCode871();int result = leetcode871.minRefuelStops(target, startFuel, stations);System.out.println("result = "+result);}}

程序運(yùn)行結(jié)果：

result = 2

總結(jié)

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

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