python 递归

def hexes_to_udaciousness(n, spread, target): if n >= target: return 0 else: return 1 + hexes_to_udaciousness(n+n*spread, spread, target)

 

转载于:https://www.cnblogs.com/Shinered/p/9052124.html

相关资源：Python递归解析Json文件