SWUST OJ 943 顺序表插入操作的实现

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

typedef struct
{
	int 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("%d", &m);
		getchar();
		pL->data[i] = m;
	}
}

void insertSqList(SqList* pL, int item, int d)
{
	int i = 0, flag = 1, j = pL->len - 1;
	while (pL->data[i] != item)
	{
		i++;
		if (i >= pL->len)
		{
			flag = 0;
			break;
		}
	}
	pL->len++;
	if (flag = 1)
	{
		for (j = pL->len; j >= i; j--)
			pL->data[j] = pL->data[j - 1];
		pL->data[i] = d;
	}
	else if (flag = 0)
		pL->data[pL->len] = d;
}

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

int main()
{
	int item, d;
	SqList* pL;
	pL = (SqList*)malloc(sizeof(SqList));
	initSqList(pL);
	scanf("%d", &item);
	scanf("%d", &d);
	insertSqList(pL, item, d);
	dispSqList(pL);
	return 0;
}