CS 61A 2020 Fall Lab 5: Data Abstraction, Trees

最新推荐文章于 2023-07-20 17:15:51 发布

Denny980

最新推荐文章于 2023-07-20 17:15:51 发布

阅读量1.4k

点赞数 2

分类专栏： CS61A 文章标签： python

本文链接：https://blog.csdn.net/Denny5608/article/details/120599158

版权

这篇博客介绍了CS 61A课程中关于数据抽象和树的实验内容。涉及实现包括Q1的元素配对、Q2的距离计算、Q3的最近城市判断、Q5的树中寻找浆果节点以及Q6的树形结构扩展等函数。实验通过Python进行，要求使用列表解析和坐标计算等技巧解决问题。

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

Q1: Couple

Implement the function couple, which takes in two lists and returns a list that contains lists with i-th elements of two sequences coupled together. You can assume the lengths of two sequences are the same. Try using a list comprehension.

def couple(s, t):
    """Return a list of two-element lists in which the i-th element is [s[i], t[i]].

    >>> a = [1, 2, 3]
    >>> b = [4, 5, 6]
    >>> couple(a, b)
    [[1, 4], [2, 5], [3, 6]]
    >>> c = ['c', 6]
    >>> d = ['s', '1']
    >>> couple(c, d)
    [['c', 's'], [6, '1']]
    """
    assert len(s) == len(t)
    "*** YOUR CODE HERE ***"
    return [[s[i], t[i]] for i in range(len(s))]

Q2: Distance

We will now implement the function distance, which computes the distance between two city objects. Recall that the distance between two coordinate pairs (x1, y1) and (x2, y2) can be found by calculating the sqrt of (x1 - x2)**2 + (y1 - y2)**2. We