1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
|
struct ListNode *createlist()
{
struct ListNode *r,*s,*L,*head;
int n,i=0;
L=(struct ListNode *)malloc(sizeof(struct ListNode));
r=L;
scanf("%d",&n);
while(n!=-1)
{
s=(struct ListNode *)malloc(sizeof(struct ListNode));
s->data=n;
r->next=s;
r=s;
i=i+1;
if(i==1)
head=s;
scanf("%d",&n);
}
r->next=NULL;
return head;}
struct ListNode *deleteeven( struct ListNode *head )
{
struct ListNode *p,*q;
p=head;
while(p->next!=NULL)
{ if(p->next->data%2==0)
{
p->next=p->next->next;
p=p->next;}
else
p=p->next;
}
return head;
}
|
