leetcode::second_minimum_time_to_reach_destination 命名空间参考

LeetCode 2045. 到达目的地的第二短时间 更多...

类
class	Solution
struct	status

函数
	TEST (second_minimum_time_to_reach_destination, case1)
	TEST (second_minimum_time_to_reach_destination, case2)

详细描述

LeetCode 2045. 到达目的地的第二短时间

函数说明

TEST() [1/2]

leetcode::second_minimum_time_to_reach_destination::TEST	(	second_minimum_time_to_reach_destination	,
		case1
	)

在文件 leetcode_test.cpp 第 1020 行定义.

                                                              {
            int inputs[][2] = {{1, 2}, {1, 3}, {1, 4}, {3, 4}, {4, 5}};
            auto vec        = vector<vector<int>>();
            for(const auto *input: inputs) {
                auto n_vec = vector<int>();
                n_vec.resize(2);
                n_vec[0] = input[0];
                n_vec[1] = input[1];
                vec.push_back(n_vec);
            }
            ASSERT_EQ(13, Solution::secondMinimum(5, vec, 3, 5));
        }

引用了 leetcode::second_minimum_time_to_reach_destination::Solution::secondMinimum() , 以及 pat::a::a7_2::vec.

TEST() [2/2]

leetcode::second_minimum_time_to_reach_destination::TEST	(	second_minimum_time_to_reach_destination	,
		case2
	)

在文件 leetcode_test.cpp 第 1033 行定义.

                                                              {
            int inputs[][2] = {{1, 2}};
            auto vec        = vector<vector<int>>();
            for(const auto *input: inputs) {
                auto n_vec = vector<int>();
                n_vec.resize(2);
                n_vec[0] = input[0];
                n_vec[1] = input[1];
                vec.push_back(n_vec);
            }
            ASSERT_EQ(11, Solution::secondMinimum(2, vec, 3, 2));
        }

引用了 leetcode::second_minimum_time_to_reach_destination::Solution::secondMinimum() , 以及 pat::a::a7_2::vec.