西工大数据结构理论NOJ的第二部分，链表的操作

#include<iostream>
using namespace std;
typedef struct lnode
{
	int data;
	struct lnode* next;
}lnode;
lnode* initlinklist()
{
	lnode* p = new lnode;
	p->data = 0;
	p->next = NULL;
	return p;
}
void input(lnode* L,int enumb)
{
	lnode* temp = L;
	for (int i = 0; i < enumb; i++)
	{
		lnode* p = new lnode;
		cin >> p->data;
		p->next = NULL;
		temp->next = p;
		temp = p;
	}
}
void destroylinklist(lnode* p)
{
	lnode* fr = NULL;
	while (p)
	{
		fr = p;
		p = p->next;
		delete fr;
	}

}
void mergelinklist(lnode* A, lnode* B,lnode* C)
{
	lnode* pa = A->next;
	lnode* pb = B->next;
	lnode* pc = C = A;
	lnode* pd;
	while (pa && pb)
	{
		if (pa->data <= pb->data)
		{
			pc->next = pa;
			pc = pa;
			pa = pa->next;
		}
		else
		{
			pc->next = pb;
			pc = pb;
			pb = pb->next;
		}
	}
	pc->next = pa ? pa : pb;
	B->next=NULL;
}
void inversel(lnode* L, int enumb)
{
	lnode* p = L->next;
	lnode* q = p;
	L->next = NULL;
	for (int i = 0; i < enumb; i++)
	{
		if (i != 0)
			q = p;
		p = p->next;
		q->next = L->next;
		L->next = q;
	}
}
int main()
{
	lnode* A = initlinklist();
	lnode* B = initlinklist();
	lnode* C=NULL;
	int la, lb;
	cin >> la>>lb;
	input(A, la);
	input(B, lb);
	mergelinklist(A, B, C);
	inversel(A, la + lb);
	lnode* pa = A->next;
	while (pa)
	{
		cout << pa->data << " ";
		pa = pa->next;
	}
	cout << endl;

	destroylinklist(A);
	destroylinklist(B);
	return 0;
}

 

#include<iostream>
using namespace std;
typedef struct lnode
{
	int data;
	struct lnode* next;
}lnode;
lnode* initlinklist()
{
	lnode* p = new lnode;
	p->data = 0;
	p->next = NULL;
	return p;
}
void inputlinklist(lnode* L, int enumb)
{
	lnode* temp = L;
	for (int i = 0; i < enumb; i++)
	{
		lnode* p = new lnode;
		cin >> p->data;
		p->next = NULL;
		temp->next = p;
		temp = p;
	}
}
void destroylinklist(lnode* L)
{
	lnode* fr = NULL;
	while (L)
	{
		fr = L;
		L = L->next;
		delete fr;
	}
}
lnode* search(lnode* L, int e)
{
	lnode* p = L->next;
	while (p && p->data != e)
	{
		p = p->next;
	}
	return p;//返回指向该元素的指针
}
void delinklist(lnode* L, int e)
{
	lnode* p = search(L, e);
	if (!p)
		return;
	lnode* temp = L->next;
	while (temp && temp->next != p)
	{
		temp = temp->next;
	}
	temp->next = p->next;
	delete p;
}
int main()
{
	lnode* A = initlinklist();
	lnode* B = initlinklist();
	lnode* C = initlinklist();
	int la, lb, lc;
	cin >> la >> lb >> lc;
	inputlinklist(A, la);
	inputlinklist(B, lb);
	inputlinklist(C, lc);
	lnode* pb = B->next;
	while (pb)
	{
		if (search(C, pb->data)!=NULL)
		{
			delinklist(A, pb->data);
		}
		pb = pb->next;
	}
	lnode* pa = A->next;
	while (pa)
	{
		cout << pa->data << " ";
		pa = pa->next;
	}
	destroylinklist(A);
	destroylinklist(B);
	destroylinklist(C);
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
struct Node
{
    char data;
    int freq;
    Node* next;
    Node* pre;
};

int main()
{
    int m,n;
    Node *head,*tail,*s;
    head=(Node*)malloc(sizeof(Node));
    tail=(Node*)malloc(sizeof(Node));
    head->next=tail;
    head->pre=NULL;
    tail->pre=head;
    tail->next=NULL;
    cin>>m>>n;
    for(int i=0;i<m;i++)
    {
        s=(Node*)malloc(sizeof(Node));
        cin>>s->data;
        s->freq=0;
        s->pre=tail->pre;
        s->next=tail;
        tail->pre->next=s;
        tail->pre=s;
    }

    while(n--)
    {
        char x;
        cin>>x;
        s=head->next;
        while(x!=s->data) s=s->next;
        s->freq++;
        while(s->pre!=head&&s->freq>s->pre->freq)
        {
            Node *p=s->pre;
            p->pre->next=s;
            s->next->pre=p;
            s->pre=p->pre;
            p->next=s->next;
            s->next=p;
            p->pre=s;
        }
    }

    for(s=head->next;s!=tail;s=s->next)
        cout<<s->data<<' ';
    return 0;
}