forked from sshpark/LeetCode-Kotlin
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1472.design-browser-history.kt
136 lines (128 loc) · 4.25 KB
/
1472.design-browser-history.kt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
/*
* @lc app=leetcode id=1472 lang=kotlin
*
* [1472] Design Browser History
*
* https://leetcode.com/problems/design-browser-history/description/
*
* algorithms
* Medium (58.86%)
* Likes: 75
* Dislikes: 10
* Total Accepted: 7.1K
* Total Submissions: 12.1K
* Testcase Example: '["BrowserHistory","visit","visit","visit","back","back","forward","visit","forward","back","back"]\r\n' +
'[["leetcode.com"],["google.com"],["facebook.com"],["youtube.com"],[1],[1],[1],["linkedin.com"],[2],[2],[7]]\r'
*
* You have a browser of one tab where you start on the homepage and you can
* visit another url, get back in the history number of steps or move forward
* in the history number of steps.
*
* Implement the BrowserHistory class:
*
*
* BrowserHistory(string homepage) Initializes the object with the homepage of
* the browser.
* void visit(string url) visits url from the current page. It clears up all
* the forward history.
* string back(int steps) Move steps back in history. If you can only return x
* steps in the history and steps > x, you will return only x steps. Return the
* current url after moving back in history at most steps.
* string forward(int steps) Move steps forward in history. If you can only
* forward x steps in the history and steps > x, you will forward only x steps.
* Return the current url after forwarding in history at most steps.
*
*
*
* Example:
*
*
* Input:
*
* ["BrowserHistory","visit","visit","visit","back","back","forward","visit","forward","back","back"]
*
* [["leetcode.com"],["google.com"],["facebook.com"],["youtube.com"],[1],[1],[1],["linkedin.com"],[2],[2],[7]]
* Output:
*
* [null,null,null,null,"facebook.com","google.com","facebook.com",null,"linkedin.com","google.com","leetcode.com"]
*
* Explanation:
* BrowserHistory browserHistory = new BrowserHistory("leetcode.com");
* browserHistory.visit("google.com"); // You are in "leetcode.com".
* Visit "google.com"
* browserHistory.visit("facebook.com"); // You are in "google.com". Visit
* "facebook.com"
* browserHistory.visit("youtube.com"); // You are in "facebook.com".
* Visit "youtube.com"
* browserHistory.back(1); // You are in "youtube.com", move
* back to "facebook.com" return "facebook.com"
* browserHistory.back(1); // You are in "facebook.com", move
* back to "google.com" return "google.com"
* browserHistory.forward(1); // You are in "google.com", move
* forward to "facebook.com" return "facebook.com"
* browserHistory.visit("linkedin.com"); // You are in "facebook.com".
* Visit "linkedin.com"
* browserHistory.forward(2); // You are in "linkedin.com", you
* cannot move forward any steps.
* browserHistory.back(2); // You are in "linkedin.com", move
* back two steps to "facebook.com" then to "google.com". return "google.com"
* browserHistory.back(7); // You are in "google.com", you
* can move back only one step to "leetcode.com". return "leetcode.com"
*
*
*
* Constraints:
*
*
* 1 <= homepage.length <= 20
* 1 <= url.length <= 20
* 1 <= steps <= 100
* homepage and url consist of '.' or lower case English letters.
* At most 5000 calls will be made to visit, back, and forward.
*
*/
// @lc code=start
class BrowserHistory(homepage: String) {
val st = Array<String>(5005) {""}
var cnt = 1
var top = 1
init {
st[1] = homepage
}
fun visit(url: String) {
if (cnt == top) {
st[++cnt] = url;
++top;
} else {
st[cnt+1] = url;
top = cnt+1;
++cnt;
}
}
fun back(steps: Int): String {
if (steps >= cnt) {
cnt = 1;
return st[cnt];
} else {
cnt -= steps;
return st[cnt];
}
}
fun forward(steps: Int): String {
if (steps+cnt >= top) {
cnt = top;
return st[cnt];
} else {
cnt += steps;
return st[cnt];
}
}
}
/**
* Your BrowserHistory object will be instantiated and called as such:
* var obj = BrowserHistory(homepage)
* obj.visit(url)
* var param_2 = obj.back(steps)
* var param_3 = obj.forward(steps)
*/
// @lc code=end