-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathCoinTest.cpp
More file actions
56 lines (43 loc) · 1.28 KB
/
Copy pathCoinTest.cpp
File metadata and controls
56 lines (43 loc) · 1.28 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
//Copyright [2018] [Haibo Yan]
//
//Licensed under the Apache License, Version 2.0 (the "License");
//you may not use this file except in compliance with the License.
//You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
//Unless required by applicable law or agreed to in writing, software
//distributed under the License is distributed on an "AS IS" BASIS,
//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
//See the License for the specific language governing permissions and
//limitations under the License.
//
// Created by haibo on 3/27/18.
//
#include "gtest/gtest.h"
#include "../../algorithm/dp/Coin.h"
TEST(CoinTest, fewest1) {
vector<int> coins = {1, 2, 5};
Coin coin(coins);
ASSERT_EQ(coin.fewest(5), 1);
}
TEST(CoinTest, fewest2) {
vector<int> coins = {1, 2, 4};
Coin coin(coins);
ASSERT_EQ(coin.fewest(11), 4);
}
TEST(CoinTest, combination1) {
vector<int> coins = {1, 2, 5};
Coin coin(coins);
ASSERT_EQ(coin.combinations(5), 4);
}
TEST(CoinTest, combination2) {
vector<int> coins = {2};
Coin coin(coins);
ASSERT_EQ(coin.combinations(3), 0);
}
TEST(CoinTest, combination3) {
vector<int> coins = {10};
Coin coin(coins);
ASSERT_EQ(coin.combinations(10), 1);
}