//mylist.h
struct Node{
int data;
struct Node *next;
};
class List{
public:
List();//构造空链表
~List();//销毁链表
void insertlist(int d);
void traverselist();
private:
Node *head;
};
//mylist.cpp
#include <iostream>
#include <stdio.h>
#include "mylist.h"
using namespace std;
List::List(){
head = new Node;
head->next = NULL;
}
List::~List(){
Node *t = head;
while(head){
head = head->next;
delete t;
t = head;
}
}
void List::insertlist(int d){
Node *cur = new Node;
cur->data = d;
cur->next = head->next;
head->next = cur;
}
void List::traverselist(){
Node *ph = head->next;
while(ph != NULL){
cout<<ph->data<<endl;
ph = ph->next;
}
}
//main.cpp
#include <iostream>
#include "mylist.h"
using namespace std;
int main(){
List list;
list.insertlist(1);
list.insertlist(2);
list.insertlist(3);
list.traverselist();
return 0;
}
C++ : 实现链表
猜你喜欢
转载自blog.csdn.net/yangjinjingbj/article/details/104056331
今日推荐
周排行