- 博客(2)
- 收藏
- 关注
RSS订阅原创 recursive function
recursionSyntactically, recursion is the simple: it is a function that calls itself. e.g.:def f(n): ... f(n-1)recursive functiondef factorial(n): if n == 1: return 1 # base case if n > 1: return n * factorial(n - 1) # recu
2021-02-28 10:55:40
313
原创 TypeError: ‘str‘ object is not callable
input()output the total number of vowels and the total number of consonants in the sentence. Note: special charactersdef num_vow_and_cons(x): for e in x: if e == string.punctuation(): x = x.replace(e, "") else:
2021-02-26 12:56:17
90
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人