leetcode::permutations 命名空间参考

LeetCode 46. 全排列 更多...

类
class	Solution

函数
	TEST (permutations, case1)
	TEST (permutations, case2)
	TEST (permutations, case3)

详细描述

LeetCode 46. 全排列

函数说明

TEST() [1/3]

leetcode::permutations::TEST	(	permutations	,
		case1	)

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

                                  {
            int input[] = {1};
            auto vec    = vector(begin(input), end(input));
            auto ans    = vector<vector<int>>();
            auto ans1   = vector<int>();
            ans1.push_back(1);
            ans.push_back(ans1);
            ASSERT_EQ(ans, Solution::permute(vec));
        }

引用了 leetcode::permutations::Solution::permute().

TEST() [2/3]

leetcode::permutations::TEST	(	permutations	,
		case2	)

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

                                  {
            int input[] = {0, 1};
            auto vec    = vector(begin(input), end(input));
            auto ans    = vector<vector<int>>();
            auto ans1   = vector<int>();
            ans1.push_back(0);
            ans1.push_back(1);
            ans.push_back(ans1);
            auto ans2 = vector<int>();
            ans2.push_back(1);
            ans2.push_back(0);
            ans.push_back(ans2);
            ASSERT_EQ(ans, Solution::permute(vec));
        }

引用了 leetcode::permutations::Solution::permute().

TEST() [3/3]

leetcode::permutations::TEST	(	permutations	,
		case3	)

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

                                  {
            int input[]       = {1, 2, 3};
            auto vec          = vector(begin(input), end(input));
            auto ans          = vector<vector<int>>();
            int outputs[6][3] = {{1, 2, 3}, {1, 3, 2}, {2, 1, 3}, {2, 3, 1}, {3, 1, 2}, {3, 2, 1}};
            for(auto &output: outputs) {
                ans.emplace_back(begin(output), end(output));
            }
            ASSERT_EQ(ans, Solution::permute(vec));
        }

引用了 leetcode::permutations::Solution::permute().