你有一个只支持单个标签页的 浏览器 ,最开始你浏览的网页是 homepage
,你可以访问其他的网站 url
,也可以在浏览历史中后退 steps
步或前进 steps
步。
请你实现 BrowserHistory
类:
BrowserHistory(string homepage)
,用homepage
初始化浏览器类。void visit(string url)
从当前页跳转访问url
对应的页面 。执行此操作会把浏览历史前进的记录全部删除。string back(int steps)
在浏览历史中后退steps
步。如果你只能在浏览历史中后退至多x
步且steps > x
,那么你只后退x
步。请返回后退 至多steps
步以后的url
。string forward(int steps)
在浏览历史中前进steps
步。如果你只能在浏览历史中前进至多x
步且steps > x
,那么你只前进x
步。请返回前进 至多steps
步以后的url
。
示例:
输入: ["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]] 输出: [null,null,null,null,"facebook.com","google.com","facebook.com",null,"linkedin.com","google.com","leetcode.com"] 解释: BrowserHistory browserHistory = new BrowserHistory("leetcode.com"); browserHistory.visit("google.com"); // 你原本在浏览 "leetcode.com" 。访问 "google.com" browserHistory.visit("facebook.com"); // 你原本在浏览 "google.com" 。访问 "facebook.com" browserHistory.visit("youtube.com"); // 你原本在浏览 "facebook.com" 。访问 "youtube.com" browserHistory.back(1); // 你原本在浏览 "youtube.com" ,后退到 "facebook.com" 并返回 "facebook.com" browserHistory.back(1); // 你原本在浏览 "facebook.com" ,后退到 "google.com" 并返回 "google.com" browserHistory.forward(1); // 你原本在浏览 "google.com" ,前进到 "facebook.com" 并返回 "facebook.com" browserHistory.visit("linkedin.com"); // 你原本在浏览 "facebook.com" 。 访问 "linkedin.com" browserHistory.forward(2); // 你原本在浏览 "linkedin.com" ,你无法前进任何步数。 browserHistory.back(2); // 你原本在浏览 "linkedin.com" ,后退两步依次先到 "facebook.com" ,然后到 "google.com" ,并返回 "google.com" browserHistory.back(7); // 你原本在浏览 "google.com", 你只能后退一步到 "leetcode.com" ,并返回 "leetcode.com"
提示:
1 <= homepage.length <= 20
1 <= url.length <= 20
1 <= steps <= 100
homepage
和url
都只包含 '.' 或者小写英文字母。- 最多调用
5000
次visit
,back
和forward
函数。
提示 1
Use two stacks: one for back history, and one for forward history. You can simulate the functions by popping an element from one stack and pushing it into the other.
提示 2
Can you improve program runtime by using a different data structure?
解法1:模拟
两个栈,一个栈存放历史页面(后退页面)和当前页面,另一个存放未来页面(前进页面)。
Java版:
class BrowserHistory {
private Deque<String> s1;
private Deque<String> s2;
public BrowserHistory(String homepage) {
s1 = new LinkedList<>();
s2 = new LinkedList<>();
s1.push(homepage);
}
public void visit(String url) {
s1.push(url);
s2.clear();
}
public String back(int steps) {
for (int i = 0; i < steps && s1.size() > 1; i++) {
s2.push(s1.pop());
}
return s1.peek();
}
public String forward(int steps) {
for (int i = 0; i < steps && !s2.isEmpty(); i++) {
s1.push(s2.pop());
}
return s1.peek();
}
}
/**
* Your BrowserHistory object will be instantiated and called as such:
* BrowserHistory obj = new BrowserHistory(homepage);
* obj.visit(url);
* String param_2 = obj.back(steps);
* String param_3 = obj.forward(steps);
*/
Python3版:
class BrowserHistory:
def __init__(self, homepage: str):
self.s1 = list()
self.s2 = list()
self.s1.append(homepage)
def visit(self, url: str) -> None:
self.s1.append(url)
self.s2.clear()
def back(self, steps: int) -> str:
for i in range(min(steps, len(self.s1) - 1)):
self.s2.append(self.s1.pop())
return self.s1[-1]
def forward(self, steps: int) -> str:
for i in range(min(steps, len(self.s2))):
self.s1.append(self.s2.pop())
return self.s1[-1]
# Your BrowserHistory object will be instantiated and called as such:
# obj = BrowserHistory(homepage)
# obj.visit(url)
# param_2 = obj.back(steps)
# param_3 = obj.forward(steps)
复杂度分析
- 时间复杂度:O(n),其中 n 为操作次数。
- 空间复杂度:O(n)。