题解 | #走方格的方案数#
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
def f(m,n):
if m==0:
return 1
elif n==1:
return m+1
else:
return f(m-1,n)+f(m,n-1)
while True:
try:
m,n=map(int,input().split())
print(f(m,n))
except:
break
if m==0:
return 1
elif n==1:
return m+1
else:
return f(m-1,n)+f(m,n-1)
while True:
try:
m,n=map(int,input().split())
print(f(m,n))
except:
break
查看29道真题和解析
感觉非常棒了，过几天面试肯定多了，现在太早