c语言实现 顺序表、链表的取极值

 顺序表：

int findMax(seqlist* s) {
	int index = 0, max = s->data[0];
	for (int i = 0; i < s->length; i++) {
		if (max < s->data[i]) {
			index = i;
			max = s->data[i];
		}
	}
	return max;
}

 单链表：

int findMax(LinkList L) {
    //pMax为最大值的指针？？
	LinkList p = L->next, pMax = L->next;
	int max = p->data;
	int index = 0, i = 0;
	while (p) {
		if (max < p->data) {
			max = p->data;
			index = i;
			pMax = p;
		}
		i++;	p = p->next;
	}
	return max;
}