leetcode::minimum_cost_of_buying_candies_with_discount 命名空间参考

LeetCode 5971. 打折购买糖果的最小开销 更多...

类
class	Solution

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

详细描述

LeetCode 5971. 打折购买糖果的最小开销

函数说明

TEST() [1/3]

leetcode::minimum_cost_of_buying_candies_with_discount::TEST	(	minimum_cost_of_buying_candies_with_discount	,
		case1	)

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

                                                                  {
            int input[] = {1, 2, 3};
            auto vec    = vector(begin(input), end(input));
            ASSERT_EQ(5, Solution::minimumCost(vec));
        }

引用了 leetcode::minimum_cost_of_buying_candies_with_discount::Solution::minimumCost().

TEST() [2/3]

leetcode::minimum_cost_of_buying_candies_with_discount::TEST	(	minimum_cost_of_buying_candies_with_discount	,
		case2	)

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

                                                                  {
            int input[] = {6, 5, 7, 9, 2, 2};
            auto vec    = vector(begin(input), end(input));
            ASSERT_EQ(23, Solution::minimumCost(vec));
        }

引用了 leetcode::minimum_cost_of_buying_candies_with_discount::Solution::minimumCost().

TEST() [3/3]

leetcode::minimum_cost_of_buying_candies_with_discount::TEST	(	minimum_cost_of_buying_candies_with_discount	,
		case3	)

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

                                                                  {
            int input[] = {5, 5};
            auto vec    = vector(begin(input), end(input));
            ASSERT_EQ(10, Solution::minimumCost(vec));
        }

引用了 leetcode::minimum_cost_of_buying_candies_with_discount::Solution::minimumCost().