### 办公室分配问题的Python实现 对于办公室分配问题，可以将其视为一种资源分配或调度问题。这类问题通常涉及到多个约束条件以及目标函数的最大化或最小化。下面提供了一种基于优先级和权重的方法来解决此问题。 #### 使用类定义房间和个人需求 为了更好地管理和处理每个人员的需求及可用空间的信息，建议创建两个主要的数据结构——`Person` 和 `Room` 类： ```python class Person: def __init__(self, name, department, preferences=None): self.name = name self.department = department if not preferences: preferences = [] self.preferences = preferences # List of preferred room IDs def get_score(self, room_id): try: return len(self.preferences) - self.preferences.index(room_id) except ValueError: return 0 class Room: def __init__(self, id_, capacity): self.id_ = id_ self.capacity = capacity self.occupants = [] @property def available_seats(self): return max(0, self.capacity - len(self.occupants)) def add_person(self, person): if self.available_seats > 0: self.occupants.append(person) return True else: return False ``` #### 实现分配逻辑 接下来是核心部分—分配过程本身。这可以通过遍历所有人员并尝试满足他们的偏好来进行；如果无法满足，则寻找其他合适的空位直到找到为止。 ```python def assign_rooms(people_list, rooms_dict): unassigned_people = list(people_list) while unassigned_people: assigned_this_round = set() for person in sorted(unassigned_people, key=lambda p: sum(p.get_score(r.id_) for r in rooms_dict.values()), reverse=True): best_room = None for room in sorted([room for room in rooms_dict.values() if room.available_seats], key=lambda r: (-person.get_score(r.id_), r.id_)): if room.add_person(person): best_room = room break if best_room is not None: print(f"{person.name} has been assigned to {best_room.id_}") assigned_this_round.add(person) unassigned_people = [p for p in unassigned_people if p not in assigned_this_round] still_unassigned = [p for p in people_list if all(not any(o == p for o in rm.occupants) for rm in rooms_dict.values())] if still_unassigned: print("Warning! Some individuals could not be placed:", ", ".join(p.name for p in still_unassigned)) return rooms_dict ``` 这段代码首先按照个人对不同房间评分总分降序排列待安排的人群列表，接着依次为他们挑选最理想的未满座位置。当一轮循环结束时，那些成功获得座位的人都会被移除等待队列之外。重复这一流程直至所有人都被妥善安置或是确实无处可去[^1]。