Approach 1: Array
- Time:O(1)
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 2: Stack
- Time:Constructor, visit(url: str): O(1), back(steps: int), forward(steps: int): O(\texttt{steps})
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 3: Doubly-Linked List
- Time:Constructor, visit(url: str): O(1), back(steps: int), forward(steps: int): O(\texttt{steps})
- Space:O(n)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|