刷leetcode發(fā)現(xiàn)很多題目涉及遞歸
Introduction to Java Programming, Comprehensive Version 10th
chapter 18 Recursion
例題 java代碼實(shí)現(xiàn) github
經(jīng)典遞歸算法情景：
1.遍歷某一路徑下所有文件，計(jì)算大小
2.Hanoi
Recursion bears substantial overhead. Each time the program calls a method, the system must allocate memory for all of the method’s local variables and parameters. This can consume considerable memory and requires extra time to manage memory. Any problem that can be solved recursively can be solved nonrecursively with iterations. Recursion has some negative aspects: it uses up too much time and too much memory.
tail recursion:
