获得徽章 7
赞了这篇文章
#刷题交流#
// 2. 找出 3张和2张的组合
const three = Object.keys(counts).filter(key => counts[key] >= 3);
const two = Object.keys(counts).filter(key => counts[key] >= 2);
console.log('three', three)
console.log('two', two)
// 3. 过滤符合条件的组合，五张牌的总和是否小于等于 max
const result = []
for (let i = 0; i < three.length; i++) {
for (let j = 0; j < two.length; j++) {
if (three[i] === two[j]) {
continue
}
const sum = three[i]*3 + two[j]*2
if (sum <= max) {
result.push([three[i], two[j]])
}
}
}
// 2. 找出 3张和2张的组合
const three = Object.keys(counts).filter(key => counts[key] >= 3);
const two = Object.keys(counts).filter(key => counts[key] >= 2);
console.log('three', three)
console.log('two', two)
// 3. 过滤符合条件的组合，五张牌的总和是否小于等于 max
const result = []
for (let i = 0; i < three.length; i++) {
for (let j = 0; j < two.length; j++) {
if (three[i] === two[j]) {
continue
}
const sum = three[i]*3 + two[j]*2
if (sum <= max) {
result.push([three[i], two[j]])
}
}
}
展开
评论
1