塔木德算法js代码

最新推荐文章于 2024-09-16 08:47:17 发布

luckybing~

最新推荐文章于 2024-09-16 08:47:17 发布

阅读量240

点赞数

文章标签： javascript 前端开发语言

本文链接：https://blog.csdn.net/Luckyzhoufangbing/article/details/125548853

版权

该篇博客介绍了如何运用算法解决多人分配财产的问题。通过`TwoPeopleObtain`函数处理两人情况，`firstToSecond`函数处理总数在两分界点之间的状况，以及`Talmud`函数处理塔木德分配法则。当财产总额在不同界限之间时，算法会根据特定规则公平地分配给每个人。示例中展示了当总共有500单位财产，需要分配给需求分别为100、200和300的人的情况。

摘要由CSDN通过智能技术生成

// 二人争产函数
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')