leetcode::count_of_smaller_numbers_after_self 命名空间参考

1. 计算右侧小于当前元素的个数

更多...

类
class	Solution

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

详细描述

1. 计算右侧小于当前元素的个数

函数说明

TEST() [1/3]

leetcode::count_of_smaller_numbers_after_self::TEST	(	count_of_smaller_numbers_after_self	,
		case1	)

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

                                                         {
            vector nums      = {5, 2, 6, 1};
            const vector ans = {2, 1, 1, 0};
            Solution sol;
            ASSERT_EQ(ans, sol.countSmaller(nums));
        }

引用了 leetcode::count_of_smaller_numbers_after_self::Solution::countSmaller().

TEST() [2/3]

leetcode::count_of_smaller_numbers_after_self::TEST	(	count_of_smaller_numbers_after_self	,
		case2	)

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

                                                         {
            vector nums      = {-1};
            const vector ans = {0};
            Solution sol;
            ASSERT_EQ(ans, sol.countSmaller(nums));
        }

引用了 leetcode::count_of_smaller_numbers_after_self::Solution::countSmaller().

TEST() [3/3]

leetcode::count_of_smaller_numbers_after_self::TEST	(	count_of_smaller_numbers_after_self	,
		case3	)

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

                                                         {
            vector nums      = {-1, -1};
            const vector ans = {0, 0};
            Solution sol;
            ASSERT_EQ(ans, sol.countSmaller(nums));
        }

引用了 leetcode::count_of_smaller_numbers_after_self::Solution::countSmaller().