摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/proj/scheme/#part-i-the-evaluator #problem1: 这一题没什么难度就是注意在lookup函数里面不能用get去找列表里面的值,因为可能值本身就是None def def 阅读全文
摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/disc/disc11/#q1-using-pair problem1: probelm2: def calc_eval(exp): if isinstance(exp, Pair): # Call expr 阅读全文
摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/lab/lab11/#problem-3 problem1: class Buffer: """A Buffer provides a way of accessing a sequence of token 阅读全文
摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/hw/hw08/#q4-no-repeats problem4里面想加注释,发现貌似不能用中文注释 阅读全文
摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/disc/disc10/#wwsd-3 problem1: (define (vir-fib n) (cond ((= n 0) 0) ((= n 1) 1) (else (+ (vir-fib (- n 1 阅读全文
摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/hw/hw07/#q3-pow problem1: problem2: problem3: 阅读全文
摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/lab/lab10/ problem1: problem1-6: 阅读全文
摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/lab/lab09/#topics #problem1: 注意是“return a new list" def insert_into_all(item, nested_list): """Return a 阅读全文
摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/disc/disc08/ problem1: problem2: problem3: 递归 def sum_nums(s): """ >>> a = Link(1, Link(6, Link(7))) >>> 阅读全文
摘要:
网址 https://inst.eecs.berkeley.edu/~cs61a/fa21/lab/lab08/ problem1: problem2: def convert_link(link): """Takes a linked list and returns a Python list 阅读全文