#include<iostream>
#include<stdlib.h>
using namespace std;
class Node{
public:
int data;
Node* next;
void ptrintNode(){
cout << data << endl;
}
};
class singleList{
public:
singleList();
~singleList();
bool Find(int i,int *x);
bool Insert(int i,int *x);
bool Delete(int i);
void Trverse();
private:
Node *first;//创建头指针
int n;
};
singleList::singleList(){
first = new Node;
first->data = 0;
first->next = NULL;
n = 0;
}
singleList::~singleList(){
Node *p;
while (first){
p = first->next;
delete first;
first = p;
}
}
bool singleList::Find(int i, int *x){
if (i<0||i>n-1) return false;
Node *p = first;
for (int j=0; j<i; j++){
p = p->next;
}
*x = p->data;
return true;
}
bool singleList::Insert(int i,int *x){
if (i>n || i < 0) return false;
Node *p = first;
Node *q=new Node ; q->data = *x;
for
数据结构——单链表
最新推荐文章于 2022-11-08 19:43:00 发布