64,654
社区成员
发帖
与我相关
我的任务
分享
/*********实现一个单链表的建立、测长、打印***********/
#include <iostream>
#include <iomanip>
using namespace std;
class Node
{
public:
Node();
~Node();
Node* Create();//单链表的建立
int length(Node*);//求单链表的长度
Node* DeleteList(Node*, int, int&);
// Node* InsertList(Node*, int, int);
void Print(Node*);//打印单链表
private:
int data;
Node *next;
};
Node::Node()//默认构造函数
{
data = 0;
next = NULL;
}
Node::~Node()
{
}
Node* Node::Create()//不带头结点的单链表
{
Node *head;//头指针
Node *p,*q;
head = (Node*)malloc(sizeof(Node));
p = head;
int flag = 1;
int x;
while(flag)
{
cout<<" Input x data: ";
cin>>x;
if(x != 0)//输入元素为0时结束建立链表
{
q = (Node*)malloc(sizeof(Node));
q->data = x;
cout<<"Output data: "<<q->data<<endl;
p->next = q;//将q插在p的后面
p = q;//p是记录插入的位置
}
else
flag = 0;
}
head = head->next;
p->next = NULL;
cout<<"the head of linked list is: "<<head->data<<endl;
return head;
}
int Node::length(Node *head)
{
int n = 0;
Node *p;
p = head;
while(p != NULL)
{
p = p->next;
n++;
}
return n;
}
//不带头结点的链表
Node* Node::DeleteList(Node *head, int i, int &p)
{//表示删除第i个元素,即要找到第i-1个结点
Node *q, *temp;
int j = 1;
q = head;
if(1 == i)//删除头结点
{
head = q->next;
p = q->data;
free(q);
}
else
{
while(q->next != NULL && j < i-1)//寻找删除的位置
{
q = q->next;
++j;
}
if(NULL == q->next || j > i-1)
{
cout<<"Deletion Error."<<endl;
}
else
{
temp = q->next;
q->next = temp->next;
p = temp->data;
free(temp);
}
}
return head;
}
void Node::Print(Node *head)
{
Node *p;
p = head;
int n;
n = length(head);//表的长度
cout<<"The length of linked list is: "<<n<<endl;
cout<<"The linked list: "<<endl;
while(p != NULL)
{
cout<<setw(2)<<p->data;
p = p->next;
}
cout<<endl;
}
int main()
{
Node *p = new Node;//注意对象指针的使用
Node *q;
int temp;
q = p->Create();
p->length(q);
p->Print(q);
int i;//表示要删除结点的位置
cout<<"Input i = ";
cin>>i;
p->DeleteList(q, i, temp);
p->Print(q);
cout<<endl;
return 0;
}
//假设带表头结点的单向链表头指针为head,试编写一个算法将值为5的结点插入到连接表的第k个结点前,删除第k个节点,并对该链表进行排序。
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>
struct NODE {
int data;
struct NODE *next;
} H,*head,*p,*q,*s1,*s2,*s3,*s4,*s;
int i,j,k,n,t,m;
int main() {
srand(time(NULL));
//填写头节点数据
H.data=-1;
H.next=NULL;
head=&H;
//创建10个节点的单链表
p=head;
for (i=0;i<10;i++) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) return 1;
q->data=rand()%100;//填写0..99的随机值
q->next=NULL;
p->next=q;
p=q;
}
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//将值为5的结点插入到单链表的第k个结点前
k=3;
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==n) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) return 1;
q->data=5;
q->next=p->next;
p->next=q;
break;
}
p=p->next;
}
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//删除第k个节点
k=5;
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==n) {
q=p->next;
if (q) {
p->next=q->next;
free(q);
}
break;
}
p=p->next;
}
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//从小到大排序
for (p=head;p!=NULL && p->next!=NULL;p=p->next) {
for (q=p->next;q!=NULL && q->next!=NULL;q=q->next) {
if (p->next->data > q->next->data) {
//交换data
// printf("swap %02d %02d\n",p->next->data,q->next->data);
// t=p->next->data;p->next->data=q->next->data;q->next->data=t;
//或者
//交换next
// printf("swap %02d %02d\n",p->next->data,q->next->data);
s1=p->next;
s2=p->next->next;
s3=q->next;
s4=q->next->next;
if (s2!=s3) {
p->next=s3;
s3->next=s2;
q->next=s1;
s1->next=s4;
} else {
p->next=s3;
s3->next=s1;
q=s3;
s1->next=s4;
}
//输出整个单链表
// s=head->next;
// while (1) {
// if (NULL==s) {
// printf("\n");
// break;
// }
// printf("%02d->",s->data);
// s=s->next;
// }
// getchar();
}
}
}
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//将单链表中前 m 个结点和后 n 个结点进行互换,m+n为链表总长10
m=4;
n=6;
k=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
k++;
if (m+1==k) {
q=p;
}
s=p;
p=p->next;
}
s1=head->next;
head->next=q->next;
s->next=s1;
q->next=NULL;
//输出整个单链表
s=head->next;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d->",s->data);
s=s->next;
}
//释放所有节点
p=head->next;
while (1) {
if (NULL==p) {
break;
}
q=p->next;
free(p);
p=q;
}
return 0;
}
//18->94->58->17->27->20->43->57->75->78->
//18->94->05->58->17->27->20->43->57->75->78->
//18->94->05->58->27->20->43->57->75->78->
//05->18->20->27->43->57->58->75->78->94->
//43->57->58->75->78->94->05->18->20->27->
//