We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
我们的任务是顺序遍历给定的链表
比如下面的链表
遍历的顺序应该是
12 → 99 → 37
因为我们每个节点只访问一次,时间复杂度应该是O(n)
O(n)