leetcode::path_with_maximum_gold 命名空间参考

LeetCode 1219. Path with Maximum Gold 更多...

类
class	Solution

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

详细描述

LeetCode 1219. Path with Maximum Gold

函数说明

TEST() [1/2]

leetcode::path_with_maximum_gold::TEST	(	path_with_maximum_gold	,
		case1
	)

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

                                            {
            vector<vector<int>> input = {{0, 6, 0}, {5, 8, 7}, {0, 9, 0}};
            ASSERT_EQ(24, Solution::getMaximumGold(input));
        }

引用了 leetcode::path_with_maximum_gold::Solution::getMaximumGold().

TEST() [2/2]

leetcode::path_with_maximum_gold::TEST	(	path_with_maximum_gold	,
		case2
	)

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

                                            {
            vector<vector<int>> input = {{1, 0, 7}, {2, 0, 6}, {3, 4, 5}, {0, 3, 0}, {9, 0, 20}};
            ASSERT_EQ(28, Solution::getMaximumGold(input));
        }

引用了 leetcode::path_with_maximum_gold::Solution::getMaximumGold().