topic:
Seeing this question, the idea is very simple, just violent recursion, if it is 1, then return, not just recursively, until the stack overflow catches the exception and returns false.
Indeed, this connection is easy to understand (maybe I saw this is a simple question and didn't think about anything else. Yes , in fact, it is easy to exceed the space and time), which causes the catching stack overflow exception StackOverflowError is
similar to ordinary exception throwing and catching, except that this exception is no longer a subclass of Ecption , and it belongs to the same Error exception as OutofMemoryError. That’s all for class
exceptions, let’s talk about the problem of killing a thousand swords
I am really helpless about this problem. The recursive solution just now may be okay, but the time is indeed exceeded. Good guy, I have been thinking about how to deal with this infinite repeated call situation. In the end, the recursion has no solution or violently tore it with bare hands. There is a limit number (10). If you are not happy until this number, then you are really unhappy. The result gave me this result:
The lethality is not high, and the insult is very strong. Can this be tolerated? Go and see that your official explanation is so good
I didn’t read two lines just now, and I’ve been stunned, this...
If you dare to make a question, I will count them one by one and try them out. You have a cycle... Blame me for reading too little, but at least I think you tried to find a cycle and I solved it violently.
Tired...