problemscpp
A collection of my answers to algorithm problems in c++.
| 函数
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.cpp889 行定义.

889 {
890 int input[] = {1, 2, 3};
891 auto vec = vector(begin(input), end(input));
892 ASSERT_EQ(5, Solution::minimumCost(vec));
893 }
int vec[100010]
Definition: pat.cpp:5095

引用了 leetcode::minimum_cost_of_buying_candies_with_discount::Solution::minimumCost() , 以及 pat::a::a7_2::vec.

◆ TEST() [2/3]

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

在文件 leetcode_test.cpp895 行定义.

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

引用了 leetcode::minimum_cost_of_buying_candies_with_discount::Solution::minimumCost() , 以及 pat::a::a7_2::vec.

◆ TEST() [3/3]

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

在文件 leetcode_test.cpp901 行定义.

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

引用了 leetcode::minimum_cost_of_buying_candies_with_discount::Solution::minimumCost() , 以及 pat::a::a7_2::vec.