高级农民
- 积分
- 2019
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2013-1-22
- 最后登录
- 1970-1-1
|
交一下作业,只做了必做部分:- ## Linked Lists and Sets ##
- # Linked Lists
- class Link:
- """A linked list.
- >>> s = Link(1, Link(2, Link(3, Link(4))))
- >>> len(s)
- 4
- >>> s[2]
- 3
- >>> s
- Link(1, Link(2, Link(3, Link(4))))
- """
- empty = ()
- def __init__(self, first, rest=empty):
- assert rest is Link.empty or isinstance(rest, Link)
- self.first = first
- self.rest = rest
- def __getitem__(self, i):
- if i == 0:
- return self.first
- else:
- return self.rest[i-1]
- def __len__(self):
- return 1 + len(self.rest)
- def __repr__(self):
- if self.rest is not Link.empty:
- rest_str = ', ' + repr(self.rest)
- else:
- rest_str = ''
- return 'Link({0}{1})'.format(repr(self.first), rest_str)
- def slice_link(link, start, end):
- """Slices a Link from start to end (as with a normal Python list).
- >>> link = Link(3, Link(1, Link(4, Link(1, Link(5, Link(9))))))
- >>> slice_link(link, 1, 4)
- Link(1, Link(4, Link(1)))
- """
- "*** YOUR CODE HERE ***"
- if start > 0:
- return slice_link(link.rest, start - 1, end - 1)
- elif start == end:
- return Link.empty
- else:
- res = Link(link.first)
- res.rest = slice_link(link.rest, start, end - 1)
- return res
- # Sets
- def union(s1, s2):
- """Returns the union of two sets.
- >>> r = {0, 6, 6}
- >>> s = {1, 2, 3, 4}
- >>> t = union(s, {1, 6})
- >>> t
- {1, 2, 3, 4, 6}
- >>> union(r, t)
- {0, 1, 2, 3, 4, 6}
- """
- "*** YOUR CODE HERE ***"
- union_set = set()
- for element in s1:
- union_set.add(element)
- for element in s2:
- if element not in s1:
- union_set.add(element)
- return union_set
-
- def intersection(s1, s2):
- """Returns the intersection of two sets.
- >>> r = {0, 1, 4, 0}
- >>> s = {1, 2, 3, 4}
- >>> t = intersection(s, {3, 4, 2})
- >>> t
- {2, 3, 4}
- >>> intersection(r, t)
- {4}
- """
- "*** YOUR CODE HERE ***"
- intersection_set = set()
- for elem in s1:
- if elem in s2:
- intersection_set.add(elem)
- return intersection_set
- def extra_elem(a,b):
- """B contains every element in A, and has one additional member, find
- the additional member.
- >>> extra_elem(['dog', 'cat', 'monkey'], ['dog', 'cat', 'monkey', 'giraffe'])
- 'giraffe'
- >>> extra_elem([1, 2, 3, 4, 5], [1, 2, 3, 4, 5, 6])
- 6
- """
- "*** YOUR CODE HERE ***"
- return list(set(b) - set(a))[0]
- def find_duplicates(lst):
- """Returns True if lst has any duplicates and False if it does not.
- >>> find_duplicates([1, 2, 3, 4, 5])
- False
- >>> find_duplicates([1, 2, 3, 4, 2])
- True
- """
- "*** YOUR CODE HERE ***"
- return len(set(lst)) != len(lst)
复制代码 |
|