// 二人争产函数
function TwoPeopleObtain (total, args) {
const min = Math.min(...args)
if (total <= min) {
return Array(args.length).fill(total / args.length)
}
const max = Math.max(...args)
if (total > min && total <= max) {
const minObtain = min / 2
const rest = total - minObtain
return args.map((item) => {
return item === min ? minObtain : rest
})
}
const totalNeed = args.reduce((a, b) => a + b)
if (total > max) {
const rest = (totalNeed - total) / args.length
return args.map((item, index) => {
return total + rest - args[args.length - 1 - index]
})
}
}
// 当总数介于两分界点之间
function firstToSecond (total, needArr) {
let resultArr = []
let targetArr = needArr
let currentTotal = total
let currentTotalNeed = needArr.reduce((a, b) => a + b)
while (targetArr.length > 1) {
let firstPeopleNeed = targetArr[0]
let restTargetNeed = currentTotalNeed - firstPeopleNeed
const result = TwoPeopleObtain(currentTotal, [firstPeopleNeed, restTargetNeed])
if (targetArr.length > 2) {
resultArr.push(result[0])
currentTotal -= result[0]
targetArr.shift()
currentTotalNeed = targetArr.reduce((a, b) => a + b)
} else {
resultArr = resultArr.concat(result)
targetArr.shift()
}
}
return resultArr
}
// 塔木德N人争产
function Talmud (total, needArr) {
const peopleNum = needArr.length
const firstPoint = Math.min(...needArr) * peopleNum / 2
const needTotal = needArr.reduce((a, b) => a + b)
const secondPoint = needTotal - firstPoint
// 当总数小于第一分界点
if (total <= firstPoint) {
return Array(peopleNum).fill(total / peopleNum)
}
// 当总数介于两分界点之间 转化为二人争产问题
if (total > firstPoint && total <= secondPoint) {
return firstToSecond(total, needArr)
}
// 当总数大于第二分界点
if (total > secondPoint) {
const rest = total - secondPoint
const resultSecondPointObtain = firstToSecond(secondPoint, needArr)
return resultSecondPointObtain.map((item) => {
return item + (rest / peopleNum)
})
}
}
const total = 500
const needArr = [100, 200, 300]
const result = Talmud(total, needArr)
console.log(result, 'result')
塔木德算法js代码
最新推荐文章于 2024-04-30 16:57:21 发布