三： 针对带表头结点的单链表，试编写下列函数。

(1) 定位函数Locate：在单链表中寻找第i个结点。若找到，则函数返回第i个结点的地址；若找不到，则函数返回NULL。

(2) 求最大值函数max：通过一趟遍历在单链表中确定值最大的结点。

(3) 统计函数number：统计单链表中具有给定值x的所有元素。

(4) 建立函数create：根据一维数组a[n]建立一个单链表，使单链表中各元素的次序与a[n]中各元素的次序相同，要求该程序的时间复杂性为O(n)。

(5) 整理函数tidyup：在非递减有序的单链表中删除值相同的多余结点。-III: Table for the first node with a single list, try to prepare the following function. (1) positioning function Locate: find a single list in the first i nodes. If found, the function returns the first i nodes of the address　if not, the function returns NULL. (2) for the maximum function max: traverse through the trip in a single list to determine the value of the largest node. (3) statistical function number: single-chain statistics with a given value of x of all elements. (4) the establishment of function create: the basis of one-dimensional array a [n] the creation of a single list, so that a single list in the order of each element with a [n] in the order of the elements the same time require the complexity of the procedure for O (n). (5) collate function tidyup: in non-descending order to remove a single list of surplus value of the same node.