数据结构顺序表练习题2（提升篇）

题目要求：

设计一个在时间效率和空间效率两个方面都尽可能高效的算法，将顺序表L中保存的数据序列循环左移P个位置 (0<P<L. length)。
例如：左移前L中的数据序列为：X1,X2,⋯,Xp,⋯,Xn,左移后L中的数据序列为：XP,XP+1,⋯,Xn―,X1,⋯,XP−1

代码实现：

#define OK 1
#define ERROR 0
#define LIST_INIT_SIZE 20
#define LISTINCREMENT 8

typedef int ElemType;
#include <iostream>
#include <iomanip>
#include <stdlib.h>
using namespace std;

typedef struct
{
	ElemType* elem;
	int length;
	int listsize;
}SqList;

int InitList_Sq(SqList& L)
{
	L.elem = new ElemType[LIST_INIT_SIZE];
	if (!L.elem) exit(OVERFLOW);

	L.length = 0;
	L.listsize = LIST_INIT_SIZE;

	return OK;
}

void CreateList_Sq(SqList& L, int* t, int n)
{
	for (int i = 0; i < n; i++)
		L.elem[i] = t[i];
	L.length = n;
}

void ListTraverse(SqList L)
{
	for (int i = 0; i < L.length; i++)
		cout << setw(6) << setfill(' ') << L.elem[i];
	cout << endl;
}

void leftmoveList_Sq(SqList& L, int p)
{
	//原地逆置
	for (int i = 0; i < L.length / 2; i++)
	{
		ElemType temp = *(L.elem + i);
		*(L.elem + i) = *(L.elem + L.length - i - 1);
		*(L.elem + L.length - i - 1) = temp;
	}
	for (int j = 0; j < (L.length - p + 1) / 2; j++)
	{
		ElemType temp = *(L.elem + j);
		*(L.elem + j) = *(L.elem + L.length - p - j);
		*(L.elem + L.length - p - j) = temp;
	}
	for (int k =0 ; k < p / 2; k++)
	{
		ElemType temp = *(L.elem + L.length - p + 1 + k);
		*(L.elem + L.length - p + 1 + k) = *(L.elem + L.length - 1 - k);
		*(L.elem + L.length - 1 - k) = temp;
	}
	//创建辅助空间
	//SqList S;   InitList_Sq(S);  //定义顺序表S为临时空间,并初始化

	//for (int i = 0; i < p - 1; i++)     //将左移位置前的元素移动到顺序表S中
	//	*(S.elem + i) = *(L.elem + i);

	//for (int i = p; i <= L.length; i++)   //L.elem中的元素往前移
	//	*(L.elem + i - p) = *(L.elem + i - 1);

	//for (int i = 0; i < p; i++)     //将顺序表S中的元素依次移动到L.elem后面
	//	*(L.elem + i + L.length - p + 1) = *(S.elem + i);

	//delete []S.elem;
	//S.elem = NULL;
}

int Delete_Sq(SqList& L)
{
	if (!L.elem) return 0;
	delete[]L.elem;
	L.elem = NULL;

	return OK;
}

int main()
{
	SqList L ;
	int p = 0;
	int left=0, right=9;

	int a[9] = { 12, 25, 34, 56, 78, 88, 94, 100, 108};

	int lable = InitList_Sq(L);
	CreateList_Sq(L, a, 9);
	if (lable)
		cout << "顺序表L为" << endl;
	ListTraverse(L);

	//循环左移元素
	cin >> p;
	cout << "元素左移后的顺序表L为：" << endl;
	leftmoveList_Sq(L,p);
	ListTraverse(L);

	Delete_Sq(L);

	return OK;
}

实验结果：

代码内有注释，便于大家理解，有看不懂的位置直接问博主就好！