python基础练习题:笛卡尔的邻居【难度：1级】--景越Python编程实例训练营,不同难度Python习题，适合自学Python的新手进阶

python基础练习题:笛卡尔的邻居【难度:1级】:

一个直角坐标系是一个坐标系,通过在一对数字坐标,这是本由两个固定垂直定向线签名距离的点,在长度的相同的单元测量的唯一地指定在一个平面上的每个点.

一个点的网格中的сoordinates写为(X,Y).在坐标系中的每个点有八个相邻点.条件是该网格步= 1.

有必要写一个函数,在x轴和y轴的坐标,并返回所有相邻点的列表.内部列表点没有被分类(任意顺序是有效的).

例如:

ç
cartesian_neighbor(2,2) - > {{1,1},{1,2},{1,3},{2,1},{2,3},{3,1},{3,2} ,{3,3}}
cartesian_neighbor(5,7) - > {{6,7},{6,6},{6,8},{4,7},{4,6},{4,8},{5,6} ,{5,8}}

cartesianNeighbor(2,2) - > {{1,1},{1,2},{1,3},{2,1},{2,3},{3,1},{3,2} ,{3,3}}
cartesianNeighbor(5,7) - > {{6,7},{6,6},{6,8},{4,7},{4,6},{4,8},{5,6} ,{5,8}}

cartesianNeighbor(2,2) - > {{1,1},{1,2},{1,3},{2,1},{2,3},{3,1},{3,2} ,{3,3}}
cartesianNeighbor(5,7) - > {{6,7},{6,6},{6,8},{4,7},{4,6},{4,8},{5,6} ,{5,8}}

cartesianNeighbor(2,2) - > {{1,1},{1,2},{1,3},{2,1},{2,3},{3,1},{3,2} ,{3,3}}
cartesianNeighbor(5,7) - > {{6,7},{6,6},{6,8},{4,7},{4,6},{4,8},{5,6} ,{5,8}}

cartesian_neighbor(2,2) - > [(1,1),(1,2),(1,3),(2,1),(2,3),(3,1),(3,2) ,(3,3)]
cartesian_neighbor(5,7) - > [(6,7),(6,6),(6,8),(4,7),(4,6),(4,8),(5,6) ,(5,8)]

cartesian_neighbor(2,2) - > [[1,1],[1,2],[1,3],[2,1],[2,3],[3,1],[3,2] ,[3,3]
cartesian_neighbor(5,7) - > [[6,7],[6,6],[6,8],[4,7],[4,6],[4,8],[5,6] ,[5,8]

cartesianNeighbor(2,2) - > [[1,1],[1,2],[1,3],[2,1],[2,3],[3,1],[3,2] ,[3,3]
cartesianNeighbor(5,7) - > [[6,7],[6,6],[6,8],[4,7],[4,6],[4,8],[5,6] ,[5,8]

cartesianNeighbor(2,2) - > [(1,1),(1,2),(1,3),(2,1),(2,3),(3,1),(3,2) ,(3,3)]
cartesianNeighbor(5,7) - > [(6,7),(6,6),(6,8),(4,7),(4,6),(4,8),(5,6) ,(5,8)]

cartesianNeighbor(2,2) - > [[1,1],[1,2],[1,3],[2,1],[2,3],[3,1],[3,2] ,[3,3]
cartesianNeighbor(5,7) - > [[6,7],[6,6],[6,8],[4,7],[4,6],[4,8],[5,6] ,[5,8]

去
CartesianNeighbor(2,2) - > {{1,1},{1,2},{1,3},{2,1},{2,3},{3,1},{3,2} ,{3,3}}
CartesianNeighbor(5,7) - > {{6,7},{6,6},{6,8},{4,7},{4,6},{4,8},{5,6} ,{5,8}}

cartesianNeighbor(2,2) - > [[1,1],[1,2],[1,3],[2,1],[2,3],[3,1],[3,2] ,[3,3]
cartesianNeighbor(5,7) - > [[6,7],[6,6],[6,8],[4,7],[4,6],[4,8],[5,6] ,[5,8]

cartesianNeighbor(2,2) - > [[1,1],[1,2],[1,3],[2,1],[2,3],[3,1],[3,2] ,[3,3]
cartesianNeighbor(5,7) - > [[6,7],[6,6],[6,8],[4,7],[4,6],[4,8],[5,6] ,[5,8]

编程目标:

def cartesian_neighbor(x,y):
    return ...

测试样例:

test.describe("Example Test")
test.assert_equals(sorted(cartesian_neighbor(2,2)), [(1,1),(1,2),(,),(2,1),(2,3),(3,1),(3,2),(3,3)])

最佳答案(多种解法):

点击查看答案

更多关联题目:

交流讨论:

景越Python基础训练营QQ群

欢迎各位同学加群讨论,一起学习,共同成长!

免责申明:

本博客所有编程题目及答案均收集自互联网,主要用于供网友学习参考,如有侵犯你的权益请联系管理员及时删除,谢谢
题目收集至https://www.codewars/
https://www.codewars/kata/cartesian-neighbors