CS61A Lab01

本文仅包含Coding Pratice Q4 Q5 Q7

其余内容请自行在python3中运行查看

codes are as follows

def falling(n, k):
    """Compute the falling factorial of n to depth k.

    >>> falling(6, 3)  # 6 * 5 * 4
    120
    >>> falling(4, 3)  # 4 * 3 * 2
    24
    >>> falling(4, 1)  # 4
    4
    >>> falling(4, 0)
    1
    """
    falling=n
    i=1
    if k==0:
        return 1
    elif k==1:
        return falling
    else:
        while i<k:
           falling=falling*(n-1)
           i=i+1
           n=n-1
        return falling

def sum_digits(y):
    """Sum all the digits of y.

    >>> sum_digits(10) # 1 + 0 = 1
    1
    >>> sum_digits(4224) # 4 + 2 + 2 + 4 = 12
    12
    >>> sum_digits(1234567890)
    45
    >>> a = sum_digits(123) # make sure that you are using return rather than print
    >>> a
    6
    """
    "*** YOUR CODE HERE ***"
    sum = 0
    while y!=0:
        digits=y%10
        sum+=digits
        y=(y-digits)//10
    return sum 
    



def double_eights(n):
    """Return true if n has two eights in a row.
    >>> double_eights(8)
    False
    >>> double_eights(88)
    True
    >>> double_eights(2882)
    True
    >>> double_eights(880088)
    True
    >>> double_eights(12345)
    False
    >>> double_eights(80808080)
    False
    """
    "*** YOUR CODE HERE ***"
    count=0
    while y!=0:
        digits=y%10
        if digits==8:
            count=count+1
        y=(y-digits)//10
    if count>1 :
        return True
    else :
        return False