例题是:Leetcode322.兑换零钱
题目详情见:https://leetcode-cn.com/problems/coin-change/
样例
1 2 5
11
输入: coins = 1, 2, 5 , amount = 11
3
输出: 3
解释: 11 = 5 + 5 + 1
#include <iostream>
#include<vector>
using namespace std;
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int> dp;
for (int i = 0; i <= amount; ++i)
{
dp.push_back(-1);
}
dp[0] = 0;
for (int i = 1; i <= amount; ++i)
{
for (int j = 0; j < coins.size(); ++j)
{
if (i - coins[j] >= 0 && dp[i - coins[j]] != -1)
{
if (dp[i] == -1 || dp[i] > dp[i - coins[j]] + 1)
{
dp[i] = dp[i - coins[j]] + 1;
}
}
}
}
return dp[amount];
}
};
int main() {
vector<int> coins;
int a = -1;
while (cin >> a) {
coins.push_back(a);
if (cin.get() == '\n')
break;
}
int amount = -1;
cin >> amount;
Solution A;
int res = A.coinChange(coins, amount);
cout << res;
return 0;
}
思考:
while (cin >> a) {
coins.push_back(a);
if (cin.get() == '\n')
break;
}
此处通过cin.get() == '\n’读取下一个字符,实现了一行内的连续输入,直到换行符为止。适用于一行内不定长输入。