C 计算单链表的长度

#include <stdio.h>
#include <stdlib.h>

struct node{
	int data;
	struct node *next;
};

node * InitLink()
{
	node *p,*head,*newNode;
	head = (node*)malloc(sizeof(node));
	p = head;
	int array[] = {122,133,313,122,11,12,22,85,52};
	int i = 0;
	while(i<sizeof(array)/sizeof(int))
	{
		newNode = (node*)malloc(sizeof(node));
		newNode->data = array[i]; 
		p->next = newNode;
		p = p->next;
		p->next = NULL;
		i++;
	}
	head = head->next;
	return head;
}

int length(node *head){   
	node *p = head;   
	int len = 0;   
	while(p!=NULL)   
	{   
		len++;   
		p = p->next;   
	}   
	return len;   

};  


int main()
{
	node *head = InitLink();
	printf("%d\n",length(head)); //9
	return 0;
}