leetcode::number_of_longest_increasing_subsequence 命名空间参考

1. Number of Longest Increasing Subsequence

更多...

类
class	Solution

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

详细描述

1. Number of Longest Increasing Subsequence

函数说明

TEST() [1/2]

leetcode::number_of_longest_increasing_subsequence::TEST	(	number_of_longest_increasing_subsequence	,
		case1	)

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

                                                              {
            vector nums = {1, 3, 5, 4, 7};
            ASSERT_EQ(2, Solution::findNumberOfLIS(nums));
        }

引用了 leetcode::number_of_longest_increasing_subsequence::Solution::findNumberOfLIS().

TEST() [2/2]

leetcode::number_of_longest_increasing_subsequence::TEST	(	number_of_longest_increasing_subsequence	,
		case2	)

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

                                                              {
            vector nums = {2, 2, 2, 2, 2};
            ASSERT_EQ(5, Solution::findNumberOfLIS(nums));
        }

引用了 leetcode::number_of_longest_increasing_subsequence::Solution::findNumberOfLIS().