类链表和使用

#include
using namespace std;
struct Node {
int data;
Node* next;
Node* prev;
Node(int n_data) {
data = n_data;
next = nullptr;
prev = nullptr;
}
};
class c_list {
public:
Node* l_head;
Node* l_last;
int l_len;
c_list() {
l_head = l_last = nullptr;//用于标记的
l_len = 0;
}
~c_list() {
Node* l_temp = nullptr;
while (l_head) {
l_temp = l_head;
l_head = l_head->next;
delete l_temp;//释放指针所对应的地址的空间
}
l_temp = l_head = l_last = nullptr;
l_len = 0;
}
void pushback(int data){
Node* pnode = new Node(data);
if (l_head) {
l_last->next = pnode;
l_last = pnode;
}
else{
l_head = l_last = pnode;
}
++l_len;
}
void popfront() {
if (l_head) {
Node* ptemp = l_head;
if (l_len == 1) {
l_head = l_last = nullptr;
}
else {
l_head = l_head->next;
}
delete ptemp;
ptemp = nullptr;
–l_len;
}
}
void showlist() {
Node* temp = l_head;
while (temp)
{
cout << temp->data << " ";
temp=temp->next;
}
cout << ‘\n’;
}
int getlen() { return l_len; }
};

int main() {
c_list list;
list.pushback(1);
list.pushback(2);
list.pushback(3);
list.pushback(4);
list.showlist();
cout << list.getlen()<< endl;
list.popfront();
list.popfront();
list.popfront();
list.showlist();
cout << list.getlen()<< endl;

}