2021考研王道数据结构第一次练习题代码（不完全和答案对应）

#include
#include
#define MAX_SEQ 20
#define INCREMENT 10
using namespace std;
typedef struct LNode {
	int data;
	LNode *next;
}LNode,*LinkList;

void Init(LinkList &L)
{
	L = (LinkList ) malloc (sizeof (LNode));
	L->data = -1;
	L->next = NULL;
}
void Create(LinkList &L)
{
	int n;
	cin>>n;
	LNode *r = L;
	while(n != 9999){
		LNode* node = (LNode *) malloc (sizeof(LNode));
		r ->next = node;
		node->next = NULL;
		node->data = n;
		r = node;
		cin>>n;
	}
}
void PrintList(LinkList L)
{
	L = L->next;
	while(L){
		cout<data<<" ";
		L = L->next;
	}
}
typedef struct{
	int data[MAX_SEQ];
	int length;
	int max;
}SqList;
void Init_SqList(SqList &L)
{
	
	L.length = 0;
	L.max = MAX_SEQ;
}
bool Insert_SqList(SqList &L,int n,int i)
{
	if(i < 1 || i > L.length + 1){
		return false;
	}
	if(L.length == L.max + 1){
		return false;
	}else {
		int j;
		for(j = L.length;j>=i;j--){
			L.data[j] = L.data[j-1];
		}
		L.data[j] = n;
		L.length++;
		return true;
	}
}
void Print_Seq(SqList &L)
{
	for(int i=0;i L.length || i < 1){
		return false;
	}
	for(int j=i-1;j= t){
		cout<<"服从命令听指挥！"<=s && L.data[i] <= t){
			k++;
		}else {
			L.data[i-k] = L.data[i];
		}
	}
	L.length-=k;
}
void C01_4(SqList &L,int s,int t)
{
	int start,end;
	if(s >= t){
		cout<<"服从命令听指挥！"<=0;j--){
			if(L.data[i] == L.data[j]){
				k++;
				flag = 1;
			}
		}
		if(flag == 0)
			L.data[i-k] = L.data[i];
	}
	L.length -= k;
}
void C01_6_version2(SqList &L)
{
	int i,j;
	if(L.length == 0){
		return ;
	}
	for(i=0,j=1;i>n;
	m = n;
	int k = 0;
	int a[100];
	int b[100];
	for(int i=0;ib[j]){
			j++;
		}else{
			i++;
		}
	}
	int midst = a[i]>b[j]?b[j]:a[i];
	cout<<"中位数"<>m;
	for(int i=0;i>arr[i];
	}
	int b[m+1];
	for(int i=0;i0 && arr[i] <= m){
			b[arr[i]] = 1;
		}
	}
	int i = 1;
	for(i=1;i<=m;i++){
		if(b[i] != 1){
			cout<