leetcode::minimum_time_to_finish_the_race::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	minimumFinishTime (vector< vector< int > > &tires, int changeTime, int numLaps)

详细描述

在文件 leetcode.h 第 1409 行定义.

成员函数说明

minimumFinishTime()

int leetcode::minimum_time_to_finish_the_race::Solution::minimumFinishTime ( vector< vector< int > > &  tires, int  changeTime, int  numLaps  )

static

< 第一次用该轮胎的耗费

在文件 leetcode.cpp 第 3642 行定义.

                                                                                               {
            /* min_times[i] = 用一个轮胎跑 i 圈的最小花费 */
            vector<long long> min_times(20, 1e9);
            for(auto &v: tires) {
                const long long f    = v[0];
                const long long r    = v[1];
                const long long cost = f + changeTime;
                long long current    = f;
                long long sum        = cost;
                for(int i = 1; i <= 19; i++) {
                    min_times[i] = min(min_times[i], sum);
                    current *= r;
                    if(current > cost) {
                        current = f;
                        sum += cost;
                    } else {
                        sum += current;
                    }
                }
            }
            /* dp[i] = 跑 i 圈的最小花费 */
            vector<long long> dp(numLaps + 1, 1e9);
            dp[0] = 0;
            for(int i = 1; i <= numLaps; i++) {
                for(int j = 1; j <= min(19, i); j++) {
                    dp[i] = min(dp[i], dp[i - j] + min_times[j]);
                }
            }
            /* 最后需要减去一次换轮胎的时间 */
            return dp[numLaps] - changeTime;
        }

被这些函数引用 leetcode::minimum_time_to_finish_the_race::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp