题解 | #走方格的方案数#
走方格的方案数
http://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
def bushu(x,y):
if x < 0 or y < 0:
return 0
elif x == 0 or y == 0:
return 1
else:
return bushu(x-1, y) + bushu(x, y-1)
while True:
try:
hang,lie = map(int,input().split())
count1 = bushu(hang, lie)
print(count1)
except:
break
if x < 0 or y < 0:
return 0
elif x == 0 or y == 0:
return 1
else:
return bushu(x-1, y) + bushu(x, y-1)
while True:
try:
hang,lie = map(int,input().split())
count1 = bushu(hang, lie)
print(count1)
except:
break
投递腾讯等公司10个岗位 >