SWUST OJ 1035 定位顺序表中的最大和最小值

#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 opSqList(SqList* pL)
{
	int i = 1, j = 1, max = pL->data[0], min = pL->data[0], Lmax, Lmin;
	while (i != pL->len)
	{
		if (pL->data[i] > max)
		{
			max = pL->data[i];
			Lmax = i;
		}
		i++;
	}
	if (max == pL->data[0])
		Lmax = 0;
	while (j != pL->len)
	{
		if (pL->data[j] < min)
		{
			min = pL->data[j];
			Lmin = j;
		}
		j++;
	}
	if (min == pL->data[0])
		Lmin = 0;
	printf("Lmax=%d\n", Lmax);
	printf("Lmin=%d", Lmin);
}

int main()
{
	SqList* pL;
	pL = (SqList*)malloc(sizeof(SqList));
	initSqList(pL);
	opSqList(pL);
	return 0;
}