P17-7两个有序表合并为一个有序表

1题目要求

题目：将两个有序顺序表合并为一个新的有序顺序表，并有函数返回结果顺序表

2基本思想

与后面将要学到的归并排序算法思想一致，非常重要的一个算法

3核心代码

bool Merge(SeqList L1, SeqList L2,SeqList &L3) //L3需要返回，故带引用
{
	if (L1.length + L2.length > L3.MaxSize) return false;
	int i = 0, j = 0, k = 0;
	while(i < L1.length && j < L2.length)
	{
		if (L1.data[i] < L2.data[j])  L3.data[k++] = L1.data[i++];
		else L3.data[k++] = L2.data[j++];
	}
	while (i < L1.length)  L3.data[k++] = L1.data[i++];
	while (j < L2.length) L3.data[k++] = L2.data[j++];
	L3.length = k; //最后都要说明length的长度
	return true;
}

4完整代码

#include<stdlib.h>
#include<stdio.h>

#define InitSize 100
int len，s, t;//输入长度

typedef struct
{
	int *data;
	int MaxSize;
	int length;
}SeqList;

void PrintList(SeqList &L)
{
	for (int i = 0; i < L.length; i++)
	{
		printf("L.data[%d]=%d\n", i, L.data[i]);
	}
}

bool Merge(SeqList L1, SeqList L2,SeqList &L3) //L3需要返回，故带引用号
{
	if (L1.length + L2.length > L3.MaxSize) return false;
	int i = 0, j = 0, k = 0;
	while(i < L1.length && j < L2.length)
	{
		if (L1.data[i] < L2.data[j])  L3.data[k++] = L1.data[i++];
		else L3.data[k++] = L2.data[j++];
	}
	while (i < L1.length)  L3.data[k++] = L1.data[i++];
	while (j < L2.length) L3.data[k++] = L2.data[j++];
	L3.length = k; //最后都要说明length的长度
	return true;
}

void InitList(SeqList &L)
{
	L.data = new int[InitSize];
	L.length = 0;
	L.MaxSize = InitSize;
}

int main()
{
	SeqList L1; InitList(L1);
	SeqList L2; InitList(L2);

	L1.length = 4; L2.length = 5;
	for (int i = 0; i < L1.length; i++)
		L1.data[i] = 2 * i + 1;  //1 3 5 7

	for (int i = 0; i < L2.length; i++)
		L2.data[i] = 2 * (i + 1); //2 4 6 8 10
	SeqList L3; InitList(L3);

	
	//PrintList(L1);	PrintList(L2);
	Merge(L1, L2, L3);
	PrintList(L3);
	return 0;
}

5执行结果