| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.DesignBrowserHistory; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class DesignBrowserHistoryArray : IDesignBrowserHistory |
| | | 16 | | { |
| | | 17 | | private const int Capacity = 5000; |
| | | 18 | | private readonly string[] _history; |
| | | 19 | | private int _current; |
| | | 20 | | private int _last; |
| | | 21 | | |
| | | 22 | | /// <summary> |
| | | 23 | | /// Time complexity - O(1) |
| | | 24 | | /// Space complexity - O(1) |
| | | 25 | | /// </summary> |
| | | 26 | | /// <param name="homepage"></param> |
| | 1 | 27 | | public DesignBrowserHistoryArray(string homepage) |
| | 1 | 28 | | { |
| | 1 | 29 | | _history = new string[Capacity]; |
| | 1 | 30 | | _history[0] = homepage; |
| | 1 | 31 | | _current = 0; |
| | 1 | 32 | | _last = 0; |
| | 1 | 33 | | } |
| | | 34 | | |
| | | 35 | | /// <summary> |
| | | 36 | | /// Time complexity - O(1) |
| | | 37 | | /// Space complexity - O(1) |
| | | 38 | | /// </summary> |
| | | 39 | | /// <param name="url"></param> |
| | | 40 | | public void Visit(string url) |
| | 4 | 41 | | { |
| | 4 | 42 | | _current++; |
| | | 43 | | |
| | 4 | 44 | | _history[_current] = url; |
| | | 45 | | |
| | 4 | 46 | | _last = _current; |
| | 4 | 47 | | } |
| | | 48 | | |
| | | 49 | | /// <summary> |
| | | 50 | | /// Time complexity - O(1) |
| | | 51 | | /// Space complexity - O(1) |
| | | 52 | | /// </summary> |
| | | 53 | | /// <param name="steps"></param> |
| | | 54 | | /// <returns></returns> |
| | | 55 | | public string Back(int steps) |
| | 4 | 56 | | { |
| | 4 | 57 | | _current = Math.Max(0, _current - steps); |
| | | 58 | | |
| | 4 | 59 | | return _history[_current]; |
| | 4 | 60 | | } |
| | | 61 | | |
| | | 62 | | /// <summary> |
| | | 63 | | /// Time complexity - O(1) |
| | | 64 | | /// Space complexity - O(1) |
| | | 65 | | /// </summary> |
| | | 66 | | /// <param name="steps"></param> |
| | | 67 | | /// <returns></returns> |
| | | 68 | | public string Forward(int steps) |
| | 2 | 69 | | { |
| | 2 | 70 | | _current = Math.Min(_last, _current + steps); |
| | | 71 | | |
| | 2 | 72 | | return _history[_current]; |
| | 2 | 73 | | } |
| | | 74 | | } |