【五月集训】（第十三天）—— 双向链表_双向链表取出的节点前后指针为空-CSDN博客

本文链接：https://blog.csdn.net/weixin_49427216/article/details/124758693

文章目录

解题报告

解题报告

设计浏览器历史记录

题目链接：1472. 设计浏览器历史记录

解题思路

Current指针指向当前节点
（1）初始化一个节点，节点的前后指针置为空，值置为homepage。
（2）访问一个网页，如果 Current -> next 不为空，需要把当前页面浏览历史向前记录删除，即删除 Current -> next 之后的节点。Current -> next 为空后，在末尾插入新的节点，Current 指向新的节点。
（3）当前Current -> prev不为空且steps不为零，Current 不断向前查找节点，最后放回找到的节点的值。
（4）原理同后退，只是这是向前查找。

解题代码

struct Node{
    string val;
    Node* prev;
    Node* next;
};

class BrowserHistory {
    Node *List, *Current;
public:
    BrowserHistory(string homepage) {					//(1)
        List = new Node();
        List -> next = List -> prev = nullptr;
        List -> val = homepage;
        Current = List;
    }
    
    void visit(string url) {							//(2)
        while(Current -> next != nullptr){
            Node* temp = new Node();
            temp = Current -> next;
            Current -> next = Current -> next -> next;
            delete temp;
        }
        Current -> next = new Node();
        Current -> next -> next = nullptr;
        Current -> next -> prev = Current;
        Current -> next -> val = url;
        Current = Current -> next;
    }
    
    string back(int steps) {							//(3)
        while(steps -- && Current -> prev != nullptr){
            Current = Current -> prev;
        }
        return Current -> val;
    }
    
    string forward(int steps) {							//(4)
        while(steps -- && Current -> next != nullptr){
            Current = Current -> next;
        }
        return Current -> val;
    }
};

/**
 * 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);
 */