leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid 命名空间参考

1. 使网格图至少有一条有效路径的最小代价

更多...

类
struct	mycmp
struct	Node
class	Solution

函数
	TEST (minimum_cost_to_make_at_least_one_valid_path_in_a_grid, case1)
	TEST (minimum_cost_to_make_at_least_one_valid_path_in_a_grid, case2)
	TEST (minimum_cost_to_make_at_least_one_valid_path_in_a_grid, case3)
	TEST (minimum_cost_to_make_at_least_one_valid_path_in_a_grid, case4)
	TEST (minimum_cost_to_make_at_least_one_valid_path_in_a_grid, case5)

详细描述

1. 使网格图至少有一条有效路径的最小代价

函数说明

TEST() [1/5]

leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::TEST	(	minimum_cost_to_make_at_least_one_valid_path_in_a_grid	,
		case1
	)

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

                                                                            {
            vector<vector<int>> grid = {{1, 1, 1, 1}, {2, 2, 2, 2}, {1, 1, 1, 1}, {2, 2, 2, 2}};
            ASSERT_EQ(3, Solution::minCost(grid));
        }

引用了 leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::Solution::minCost().

TEST() [2/5]

leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::TEST	(	minimum_cost_to_make_at_least_one_valid_path_in_a_grid	,
		case2
	)

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

                                                                            {
            vector<vector<int>> grid = {{1, 1, 3}, {3, 2, 2}, {1, 1, 4}};
            ASSERT_EQ(0, Solution::minCost(grid));
        }

引用了 leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::Solution::minCost().

TEST() [3/5]

leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::TEST	(	minimum_cost_to_make_at_least_one_valid_path_in_a_grid	,
		case3
	)

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

                                                                            {
            vector<vector<int>> grid = {{1, 2}, {4, 3}};
            ASSERT_EQ(1, Solution::minCost(grid));
        }

引用了 leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::Solution::minCost().

TEST() [4/5]

leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::TEST	(	minimum_cost_to_make_at_least_one_valid_path_in_a_grid	,
		case4
	)

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

                                                                            {
            vector<vector<int>> grid = {{2, 2, 2}, {2, 2, 2}};
            ASSERT_EQ(3, Solution::minCost(grid));
        }

引用了 leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::Solution::minCost().

TEST() [5/5]

leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::TEST	(	minimum_cost_to_make_at_least_one_valid_path_in_a_grid	,
		case5
	)

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

                                                                            {
            vector<vector<int>> grid = {{4}};
            ASSERT_EQ(0, Solution::minCost(grid));
        }

引用了 leetcode::minimum_cost_to_make_at_least_one_valid_path_in_a_grid::Solution::minCost().