c++ 单项链表
#include <iostream>
using namespace std;
class MyListForward
{
private:
struct ListNode
{
int val;
ListNode *next;
ListNode(int x):val(x),next(nullptr){}
};
ListNode* head;
public:
MyListForward():head(nullptr){}
int get(int index){
int i=0;
ListNode *p=head;
while(p&&i<index){
p=p->next;
i++;
}
if(p)return p->val;
else return -1;
}
void addAtHead(int val){
ListNode *p=new ListNode(val);
p->next=head;
head=p;
}
void addAtTail(int val){
ListNode *p=new ListNode(val);
if(head==nullptr){
head=p;
return;
}
ListNode *q=head;
while(q->next){
q=q->next;
}
q->next=p;
}
void addAtIndex(int index,int val){
ListNode *node=new ListNode(val);
if(index<=0)
{
node->next=head;
head=node;
return;
}
int i=0;
ListNode *p=head;
while(p&&i<index-1)
{
p=p->next;
++i;
}
if(p)
{
node->next=p->next;
p->next=node;
}
}
void deleteAtIndex(int index){
if(index==0&&head!=nullptr)
{
ListNode *del=head;
head=head->next;
delete del;
return;
}
int i=0;
ListNode* p=head;
while(p&&i<index-1)
{
p=p->next;
i++;
}
if(!p)return;
if(p->next)
{
ListNode *del=p->next;
p->next=del->next;
delete del;
}
}
int length(){
int i=0;
ListNode *p=head;
while(p){
i++;
p=p->next;
}
return i;
}
};
int main()
{
MyListForward mlf;
mlf.addAtIndex(0,10);
mlf.addAtIndex(0,20);
mlf.addAtIndex(1,30);
for(int i=0;i<mlf.length();++i){
cout<<mlf.get(i)<<" ";
}
cout<<endl;
system("pause");
}
c++双链表
#include <iostream>
using namespace std;
class MyList
{
private:
struct ListNode
{
int val;
ListNode *next,*prev;
ListNode(int x):val(x),next(nullptr),prev(nullptr){}
};
private:
ListNode *head,*tail;
int size=0;
public:
MyList():size(0),head(nullptr),tail(nullptr){}
int get(int index){
int i=0;
ListNode *p=head;
while(p&&i<index){
p=p->next;
i++;
}
if(p)return p->val;
else return -1;
}
void addAtHead(int val){
if(head!=nullptr){
ListNode *node=new ListNode(val);
node->next=head;
head->prev=node;
head=node;
}
else{
head=new ListNode(val);
tail=head;
}
++size;
}
void addAtTail(int val){
if(tail!=nullptr){
ListNode *node=new ListNode(val);
node->prev=tail;
tail->next=node;
tail=node;
}
else{
tail=new ListNode(val);
head=tail;
}
++size;
}
void addAtIndex(int index,int val){
if(index<=0){
addAtHead(val);
return;
}
if(index==size){
addAtTail(val);
return;
}
if(index>size)return;
ListNode *p=nullptr,*cur=head;
int i=0;
while(cur&&i<index){
p=cur;
cur=cur->next;
i++;
}
ListNode *node=new ListNode(val);
p->next=node;
node->prev=p;
node->next=cur;
cur->prev=node;
size++;
}
void deleteAtIndex(int index){
if(!head)return;
if(index==0)
{
ListNode *del=head;
head=head->next;
if(head){
head->prev=nullptr;
}
else{
tail=nullptr;
}
delete del;
size--;
return;
}
if(index==size-1){
ListNode *del=tail;
tail=tail->prev;
if(tail){
tail->next=nullptr;
}
delete del;
size--;
return;
}
int i=0;
ListNode *p=nullptr,*cur=head;
while(cur){
if(i==index){
ListNode *del=cur;
p->next=cur->next;
if(cur->next){
cur->next->prev=p;
}
delete del;
size--;
return;
}
p=cur;
cur=cur->next;
++i;
}
}
int length(){
return size;
}
};
int main()
{
MyList ml;
ml.addAtHead(1);
ml.addAtTail(3);
ml.addAtHead(4);
ml.addAtHead(5);
ml.addAtIndex(1,2);
for(int i=0;i<ml.length();++i){
cout<<ml.get(i)<<" ";
}
cout<<endl;
ml.deleteAtIndex(1);
for(int i=0;i<ml.length();++i){
cout<<ml.get(i)<<" ";
}
cout<<endl;
system("pause");
}