SWUST OJ 942 逆置顺序表

ZeeE_6

于 2022-04-14 18:41:22 发布

阅读量177

点赞数 1

分类专栏： SWUST OJ

本文链接：https://blog.csdn.net/OG_Lzy/article/details/124178771

版权

C语言链表翻转顺序表数据结构

关键词由CSDN通过智能技术生成

SWUST OJ 专栏收录该内容

51 篇文章 8 订阅

订阅专栏

#include <stdio.h>
#include <stdlib.h>
#define MAX 100

typedef struct
{
	char data[MAX];
	int len;
}SqList;

void initSqList(SqList* pL)
{
	int i, n, m;
	scanf("%d", &n);
	getchar();
	pL->len = n;
	for (i = 0; i < n; i++)
	{
		scanf("%c", &m);
		pL->data[i] = m;
	}
}

void reverseSqList(SqList* pL1, SqList* pL2)
{
	int i = 0, j;
	pL2->len = pL1->len;
	j = pL1->len - 1;
	for (i = 0, j = pL1->len - 1; i <= j, j >= 0; i++, j--)
	{
		pL2->data[i] = pL1->data[j];
	}
}

void dispSqList(SqList* pL)
{
	int i;
	for (i = 0; i < pL->len; i++)
		printf("%c ", pL->data[i]);
}

int main()
{
	SqList* pLA, * pLB;
	pLA = (SqList*)malloc(sizeof(SqList));
	initSqList(pLA);
	pLB = (SqList*)malloc(sizeof(SqList));
	reverseSqList(pLA, pLB);
	dispSqList(pLB);
	return 0;
}