双链表偶数节点求和java_编写一个重新排列链表的函数，将节点置于列表中奇数位置的节点之后的偶数位置...

在下文中，每次调用swap_nodes时，另一个奇数下沉到最后一个沉没奇数。每次迭代时，均匀组合在一起，它们会冒泡到列表的末尾。这是一个例子：

/*

[0]-1-2-3-4-5

1-[0-2]-3-4-5

1-3-[0-2-4]-5

1-3-5-[0-2-4]

*/

#include

#include

#define LIST_LENGTH 10

struct node{

int id;

struct node *next;

};

void print_list(struct node *current)

{

while(NULL != current){

printf("node id = %d\n",current->id);

current = current->next;

}

printf("Done\n");

}

struct node *swap_nodes(struct node *head_even, struct node *tail_even, struct node *next_odd)

{

tail_even->next = next_odd->next;

next_odd->next = head_even;

return next_odd;

}

struct node *reorder_list(struct node *head)

{

struct node *head_even;

struct node *tail_even;

struct node *next_odd;

struct node *last_odd;

if(NULL == head->next){

return head;

}

head_even = head;

tail_even = head;

next_odd = head->next;

last_odd = head->next;

head = swap_nodes(head_even, tail_even, next_odd);

if(NULL != tail_even->next){

tail_even = tail_even->next;

}

while (NULL != tail_even->next) {

next_odd = tail_even->next;

last_odd->next = swap_nodes(head_even, tail_even, next_odd);

last_odd = last_odd->next;

if(NULL != tail_even->next){

tail_even = tail_even->next;

}

}

return head;

}

int main(void)

{

int i;

struct node *head = (struct node *) malloc(LIST_LENGTH*sizeof(struct node));

struct node *mem = head;

if(NULL == head){

return -1;

}

struct node *current = head;

for(i=0;i

current->next = current + 1;

current->id = i;

current = current->next;

}

current->next = NULL;

current->id = i;

head = reorder_list(head);

print_list(head);

free(mem);

return 0;

}