2021 fall cs61a project scheme 网址https://inst.eecs.berkeley.edu/~cs61a/fa21/proj/scheme/#part-i-the-evaluator 目录 problem1: problem1: 这一题没什么难度就是注意在lookup函数里面不能用get去找列表里面的值,因为可能值本身就是None defdefine(self, symbol, value):"""Define Scheme SYMBOL to ...
cs61a 2021 fall dis4 question1: 简单的递归 question2: 递归,类似于深度优先,每一次减掉一次的上楼走的格数,然后再以这个为新的问题,加之前的方法数。 question3: question4: 简直和List comprehensions 一样 question5: 这个也是用了递归的思想,要么取当前这一个要么不取当前这一个,然后取大的哪一种方法...
>>> import inspect, ast>>> [type(x).__name__ for x in ast.parse(inspect.getsource(two_of_three)).body[0].body]['Expr', 'Return']"""# You don't need to edit this function. It's just here to check your work.deflargest_factor(n):"""Return the largest factor of n that is...
#定义一个函数,返回函数对象本身 def a(a1,a2): def b(b1,b2): print(b1,b2) a1 = b1+b2 return a(a1,a2) return b x = a(1,2) # 调用函数a,返回父框架f1 下的函数对象b print(x) #查看地址 y= x(3,4) # 调用函数a,返回父框架f2 下的函数对象b print(y) #查看地址,y和x是两个...
cs61a2021falllab04 HW_SOURCE_FILE = __file__def summation(n, term):"""Return the sum of numbers 1 through n (including n) wíth term applied to each number.Implement using recursion!>>> summation(5, lambda x: x * x * x) # 1^3 + 2^3 + 3^3 + 4^3 + 5^3 225 >>>...
cs61a2021fallhw02 from operator import add, mul square = lambda x: x * x identity = lambda x: x triple = lambda x: 3 * x increment = lambda x: x + 1 HW_SOURCE_FILE = __file__def product(n, term):"""Return the product of the first n terms in a sequence.n: a positi...
The exercises I take when I self-study cs61a fall 2021. Only a reference for self-learners please. Activity Stars 0 stars Watchers 1 watching Forks 0 forks Report repository Releases No releases published Packages No packages published Languages Python 92.0% JavaScript 7.1% Other 0.9...
cs61a 2021 fall dis5 网址https://inst.eecs.berkeley.edu/~cs61a/fa21/disc/disc05/ problem1: problem2: problem3: problem4: problem5: problem6: problem7: problem8: 只有‘1’这个奇数乘三加一结果会是一个偶数
2021 fall cs61a hw05 网址https://inst.eecs.berkeley.edu/~cs61a/fa21/hw/hw05/#required-questions defgen_perms(seq):"""Generates all permutations of the given sequence. Each permutation is a list of the elements in SEQ in a different order. The permutations may be...
其实一开始我朋友推荐我学的是这门课,而不是cs50,但是他又说有点难,改为推荐我学cs50。于是我就先学完了cs50,再学的这门课。确实,这门课在难度上比cs50又上了一个等级,cs50我几乎是拿… 小星 CS61A 学习经验&感想 一、课程介绍这门课作为Berkeley大一新生的第一门计算机课程,是一门计算机导论的课程,主...