// 暴力破解
function getNum1(N){
let n1 = 1;
let n2 = 4;
let n3 = 5;
let last=N;
for(let i=0;i<=N;i++){
for(let j=0;j<=
1块、4块、5块,求总数n块的最小硬币数(两种解法)
最新推荐文章于 2024-01-20 12:03:25 发布
// 暴力破解
function getNum1(N){
let n1 = 1;
let n2 = 4;
let n3 = 5;
let last=N;
for(let i=0;i<=N;i++){
for(let j=0;j<=