一道算法题：德州扑克多家ALLIN如何分筹码？算法+代码

{
  'chip': 1000,  # 手上有1000筹码（对局中下注时，这里的值会实时减少，对局结束后再把赢的部分加回来）
}

{
  'i': 1,  # 座位号，从0开始
  'id': 'uuid',  # 用户ID，跟room['players']的key对应
  'all_chip': 100,  # 本局投入的所有筹码
  'action': SeatAction.Fold,  # 最终的行动
}

import enum

class SeatAction(enum.IntEnum):
    WAIT = 0
    CHECK = 1
    CALL = 2
    RAISE = 3
    ALLIN = 4
    FOLD = 5
    WIN = 6  # 胜利，不摊牌（适用其他人都Fold的情况）
    WIN_SHOW = 7  # 胜利，需要摊牌
    LOSE_SHOW = 8  # 失败，需要摊牌

playerCount = len(playing_seats)
five_cards = [cards[playerCount * 2 + 1], cards[playerCount * 2 + 2], cards[playerCount * 2 + 3], cards[playerCount * 2 + 5], cards[playerCount * 2 + 7]]

final_seats = []
for i, s in enumerate(playing_seats):
    if s['action'] < SeatAction.FOLD:
        s['score'] = get_max_score(five_cards + [cards[i], cards[i + playerCount]])
        final_seats.append(s)
    else:
        s['score'] = (-1, -1)
final_seats = sorted(final_seats, key=lambda x: x['all_chip'])

done_seats = set()
for final_seat in final_seats:
    if final_seat['i'] in done_seats:
        continue
    # 用current_chip存储本轮的最高分配额度，因为final_seat['all_chip']会变，不能一直引用final_seat['all_chip']
    current_chip = final_seat['all_chip']
    # 本轮分配的bonus_together
    bonus_together = 0
    # 以下逻辑，计算本轮分配最大牌力的玩家（们）
    max_score = (-1, -1)
    max_score_seats = []
    for other_seat in playing_seats:
        if other_seat['i'] in done_seats: 
           # 表明该玩家筹码分配完毕，就跳过该玩家
           continue
        if other_seat['score'] == max_score:
            max_score_seats.append(other_seat)
        elif other_seat['score'] > max_score:
            max_score = other_seat['score']
            max_score_seats = [other_seat]
        if other_seat['all_chip'] > current_chip:
            # 这个玩家投入的筹码超过“至多付出筹码”，只会付出“至多付出筹码”，后续还会参与下轮分配
            bonus_together += current_chip
            other_seat['all_chip'] -= current_chip
        else:
            # 这个玩家投入的筹码不够“至多付出筹码”，就全要给赢家，自己分配完毕
            done_seats.add(other_seat['i'])
            bonus_together += other_seat['all_chip']
            other_seat['all_chip'] = 0
    # 以上逻辑，计算本轮分配最大牌力的玩家（们）
    if bonus_together > 0:
        # deliver_bonus用于记录本轮分配了多少筹码，避免小数点，避免算法漏洞导致筹码总量异常
        deliver_bonus = 0
		max_score_seat = playing_seats[-1]
        for max_score_seat in max_score_seats:
            bonus = bonus_together // len(max_score_seats)  # 除数不会是0，若为0，不会进入这里逻辑
            deliver_bonus += bonus
            room['players'][max_score_seat['id']]['chip'] += bonus
        # 为了避免小数，以上计算都是向下取整，下面做个补偿。座位靠后玩家有略微优势，瓜分筹码会多分一点点。
        # 为什么是座位靠后的玩家有优势？因为庄家是从座位靠前的玩家开始轮流的，座位靠后的玩家当庄家的次数相对少一点点。
        room['players'][max_score_seat['id']]['chip'] += bonus_together - deliver_bonus