mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-06 17:38:02 +00:00
the Time complexity for reversing a linked list is O(n)
This commit is contained in:
@@ -66,7 +66,7 @@
|
|||||||
" * Only need to compare the first half\n",
|
" * Only need to compare the first half\n",
|
||||||
"\n",
|
"\n",
|
||||||
"Complexity:\n",
|
"Complexity:\n",
|
||||||
"* Time: O(1)\n",
|
"* Time: O(n)\n",
|
||||||
"* Space: O(n)\n",
|
"* Space: O(n)\n",
|
||||||
"\n",
|
"\n",
|
||||||
"Note:\n",
|
"Note:\n",
|
||||||
|
|||||||
Reference in New Issue
Block a user