64,654
社区成员
发帖
与我相关
我的任务
分享
#include<iostream>
using namespace std;
#define NULL 0
struct node
{
int data;
node* next;
};
int main()
{
node* head=new node;
node* tmp;
head->data=0;
head->next=NULL;
node* p=head;
for(int i=1;i<1000;i++)
{
tmp = new node;
tmp->data=i;
tmp->next=NULL;
head->next=tmp;
head=head->next;
}
head->next=p;
while(p!=p->next)
{
p->next->next=p->next->next->next;
p=p->next->next;
}
cout<<p->data;
return 0;
}
destory(node *p)
{
if(p->next)
{
destory(p->next);
}
delete p;
}
#include "stdafx.h"
#include<iostream>
using namespace std;
#define NULL 0
struct node
{
int data;
node* next;
};
int main()
{
node* head=new node;
node* tmp;
head->data=0;
head->next=NULL;
node* p=head;
for(int i=1;i<10;i++)
{
tmp = new node;
tmp->data=i;
tmp->next=NULL;
head->next=tmp;
head=head->next;
}
head->next=p;
int count=0;
//while(p!=p->next)
//{
// p->next->next=p->next->next->next;
// p=p->next->next;
//}
node *temp=NULL;
while(count!=10)
{
temp=p;
cout<<p->data<<endl;
p=p->next;
count++;
delete temp;//可以的 释放整个链表
}
//cout<<p->data;
return 0;
}
struct node
{
public:
~node()
{
if(next) delete next;
next = NULL;
}
int data;
node* next;
};
#include<iostream>
using namespace std;
#define NULL 0
struct node
{
int data;
node* next;
};
int main()
{
node* head=new node;
node* tmp = head;
head->data=0;
head->next=NULL;
node* p=head;
cout<<"OK1111"<<endl;
delete(tmp);
cout<<"OK2222"<<endl;
delete(p);
cout<<"OK3333"<<endl;
return 0;
}