#include<stdio.h>
#include<stdlib.h>
#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;
}
void printlink(ElemSN * h){
ElemSN * p;
for(p=h;p;p=p->next)
printf("%d\n",p->data);
}
ElemSN * fun(ElemSN*h){
ElemSN * p,* q,* h1;
h1=h;
q=h;
p=h->next;
while(p){ //遍歷鏈表p爲空時截止
if(p->data%2){
q->next=p->next; //斷裂掛鏈
p->next=h1; //生成新的鏈表
h1=p; //設置爲頭結點
}
else //偶數時：設置p指針的位置
q=p;
p=q->next; //適合奇數偶數p指正後移
}
return h1;
}
int main(void){
int a[N]={1,2,3,4,5,6,7,8,9};
ElemSN * head;
head=Createlink(a,9);
head=fun(head);
printlink(head);
}