leetcode::shortest_path_to_get_all_keys 命名空间参考

1. 获取所有钥匙的最短路径

更多...

类
struct	frame
class	Solution

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

变量
constexpr char	EMPTY = '.'
constexpr char	START = '@'
constexpr char	WALL = '#'

详细描述

1. 获取所有钥匙的最短路径

函数说明

TEST() [1/5]

leetcode::shortest_path_to_get_all_keys::TEST	(	shortest_path_to_get_all_keys	,
		case1
	)

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

                                                   {
            vector<string> grid = {"@.a.#", "###.#", "b.A.B"};
            ASSERT_EQ(8, Solution::shortestPathAllKeys(grid));
        }

引用了 leetcode::shortest_path_to_get_all_keys::Solution::shortestPathAllKeys().

TEST() [2/5]

leetcode::shortest_path_to_get_all_keys::TEST	(	shortest_path_to_get_all_keys	,
		case2
	)

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

                                                   {
            vector<string> grid = {"@..aA", "..B#.", "....b"};
            ASSERT_EQ(6, Solution::shortestPathAllKeys(grid));
        }

引用了 leetcode::shortest_path_to_get_all_keys::Solution::shortestPathAllKeys().

TEST() [3/5]

leetcode::shortest_path_to_get_all_keys::TEST	(	shortest_path_to_get_all_keys	,
		case3
	)

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

                                                   {
            vector<string> grid = {"@Aa"};
            ASSERT_EQ(-1, Solution::shortestPathAllKeys(grid));
        }

引用了 leetcode::shortest_path_to_get_all_keys::Solution::shortestPathAllKeys().

TEST() [4/5]

leetcode::shortest_path_to_get_all_keys::TEST	(	shortest_path_to_get_all_keys	,
		case4
	)

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

                                                   {
            vector<string> grid = {".@aA"};
            ASSERT_EQ(1, Solution::shortestPathAllKeys(grid));
        }

引用了 leetcode::shortest_path_to_get_all_keys::Solution::shortestPathAllKeys().

TEST() [5/5]

leetcode::shortest_path_to_get_all_keys::TEST	(	shortest_path_to_get_all_keys	,
		case5
	)

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

                                                   {
            vector<string> grid = {"..#....##.", "....d.#.D#", "#...#.c...", "..##.#..a.", "...#....##", "#....b....", ".#..#.....", "..........", ".#..##..A.", ".B..C.#..@"};
            ASSERT_EQ(19, Solution::shortestPathAllKeys(grid));
        }

引用了 leetcode::shortest_path_to_get_all_keys::Solution::shortestPathAllKeys().

变量说明

EMPTY

constexpr char leetcode::shortest_path_to_get_all_keys::EMPTY = '.'

constexpr

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

START

constexpr char leetcode::shortest_path_to_get_all_keys::START = '@'

constexpr

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

被这些函数引用 leetcode::shortest_path_to_get_all_keys::Solution::shortestPathAllKeys().

WALL

constexpr char leetcode::shortest_path_to_get_all_keys::WALL = '#'

constexpr

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

被这些函数引用 leetcode::shortest_path_to_get_all_keys::Solution::shortestPathAllKeys().