leetcode::map_of_highest_peak 命名空间参考

LeetCode 1765. 地图中的最高点 更多...

类
class	Solution

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

详细描述

LeetCode 1765. 地图中的最高点

函数说明

TEST() [1/2]

leetcode::map_of_highest_peak::TEST	(	map_of_highest_peak	,
		case1	)

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

                                         {
            int input[2][2] = {{0, 1}, {0, 0}};
            auto vec_in     = vector<vector<int>>();
            vec_in.resize(2);
            for(int i = 0; i < 2; i++) {
                vec_in[i] = vector(begin(input[i]), end(input[i]));
            }
            int output[2][2] = {{1, 0}, {2, 1}};
            auto vec_out     = vector<vector<int>>();
            vec_out.resize(2);
            for(int i = 0; i < 2; i++) {
                vec_out[i] = vector(begin(output[i]), end(output[i]));
            }
            ASSERT_EQ(vec_out, Solution::highestPeak(vec_in));
        }

引用了 leetcode::map_of_highest_peak::Solution::highestPeak().

TEST() [2/2]

leetcode::map_of_highest_peak::TEST	(	map_of_highest_peak	,
		case2	)

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

                                         {
            int input[3][3] = {{0, 0, 1}, {1, 0, 0}, {0, 0, 0}};
            auto vec_in     = vector<vector<int>>();
            vec_in.resize(3);
            for(int i = 0; i < 3; i++) {
                vec_in[i] = vector(begin(input[i]), end(input[i]));
            }
            int output[3][3] = {{1, 1, 0}, {0, 1, 1}, {1, 2, 2}};
            auto vec_out     = vector<vector<int>>();
            vec_out.resize(3);
            for(int i = 0; i < 3; i++) {
                vec_out[i] = vector(begin(output[i]), end(output[i]));
            }
            ASSERT_EQ(vec_out, Solution::highestPeak(vec_in));
        }

引用了 leetcode::map_of_highest_peak::Solution::highestPeak().