链表的遍历-奇数结点个数

#include

#include

#define N 9

typedef struct node{

int data;

struct node * next;

}ElemSN;

ElemSN * Createlink(int a[],int n){

int i;

ElemSN * h=NULL, * p;

for( i=N-1;i>=0;i--){

p=(ElemSN *)malloc(sizeof(ElemSN));

p->data =a[i];

p->next=h;

h=p;

}

return h;

}

int CoundOddNode(ElemSN*h){

int Odd=0; //奇数个数

ElemSN * p;

for(p=h;p;p=p->next)

Odd=Odd+p->data%2; //奇数data%2=0偶数data%2=1，奇数odd就加1

return Odd;

}

int main(void){

int Odd;

int a[]={1,2,3,4,5,6,7,8,9};

ElemSN *head;

head=Createlink(a,9);

Odd=CoundOddNode(head);

printf("奇数结点个数=%2d\n",Odd);

return 0;

}