README
¶
Name
singly - singly linked list
Problem
Reverse a singly linked list.
Example
Input: [1, 2, 3]
Output: [3, 2, 1]
Solution
Details
Algorithm:
- keep track of the previous and current nodes initialized to
niland the start of the list. - while current node is not
nil, cache the next node reference, link current node to the previous one, and set previous to current and current to the next.
Complexity:
- Time: O(n)
- Space: O(1)
Directories
Click to show internal directories.
Click to hide internal directories.