floor puzzles

最新推荐文章于 2021-05-25 21:04:08 发布

Pinkmanabcd

最新推荐文章于 2021-05-25 21:04:08 发布

阅读量311

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法刷题

本文链接：https://blog.youkuaiyun.com/Pinkmanabcd/article/details/98347064

数据结构与算法刷题专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一个基于Python的算法，用于解决一个特定的楼层分配谜题。通过使用itertools.permutations进行排列组合，并定义判断条件，该算法能够找出Hopper、Kay、Liskov、Perlis和Ritchie各自居住的楼层。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

根据已知问题条件进行求解

#------------------
# User Instructions
#
# Hopper, Kay, Liskov, Perlis, and Ritchie live on 
# different floors of a five-floor apartment building. 
#
# Hopper does not live on the top floor. 
# Kay does not live on the bottom floor. 
# Liskov does not live on either the top or the bottom floor. 
# Perlis lives on a higher floor than does Kay. 
# Ritchie does not live on a floor adjacent to Liskov's. 
# Liskov does not live on a floor adjacent to Kay's. 
# 
# Where does everyone live?  
# 
# Write a function floor_puzzle() that returns a list of
# five floor numbers denoting the floor of Hopper, Kay, 
# Liskov, Perlis, and Ritchie.

import itertools

def is_adjacent(a,b):
    return abs(a-b) == 1

def floor_puzzle():
    # Your code here
    for Hopper,Kay,Liskov,Perlis,Ritchie in itertools.permutations(list(range(1,6)),5):
        if Hopper == 5: continue
        if Kay == 1: continue
        if Liskov == 1 or Liskov == 5: continue
        if Perlis < Kay: continue
        if is_adjacent(Ritchie,Liskov): continue
        if is_adjacent(Liskov,Kay): continue
        return [Hopper, Kay, Liskov, Perlis, Ritchie]