Der*_*tle 3 java recursion pre-increment post-increment
假设您有一个递归方法,并在递归调用中后递增/递减值.当预增量/减量不会导致堆栈溢出异常时,为什么会这样?
防爆.
numberCount(currentNumber++); //Stack overflow exception
numberCount(++currentNumber); //No stack overflow exception
Run Code Online (Sandbox Code Playgroud)
提前感谢您的任何澄清.
jlo*_*rdo 11
首先
numberCount(currentNumber++); //Stack overflow exception
Run Code Online (Sandbox Code Playgroud)
相当于:
numberCount(currentNumber);
currentNumber += 1;
Run Code Online (Sandbox Code Playgroud)
而第二个
numberCount(++currentNumber); //No stack overflow exception
Run Code Online (Sandbox Code Playgroud)
相当于
currentNumber += 1;
numberCount(currentNumber);
Run Code Online (Sandbox Code Playgroud)
需要我解释一下吗?