数据结构 练习题
用LINUX内核函数提供的双向循环链表标准实现重做：
用双向循环链表实现顺序递增存储若干自然数，比如输入一个整数10，则建立一个双向循环链表，里面的每个节点分别存放1，2，3，4，5，6，7，8，9，10，然后通过某些操作，将其重新排列成1，3，5，7，9，10，8，6，4，2，即奇数升序偶数降序，并在屏幕上打印出来。
相信你已经掌握了“双向循环链表”、“Linux内核链表”的相关结构知识，接下来本人将会直接分析这道题目。
首先看题目的前半段：“用双向循环链表实现顺序递增存储若干自然数，比如输入一个整数10，则建立一个双向循环链表，里面的每个节点分别存放1，2，3，4，5，6，7，8，9，10。”
前半段题目要求对一个头节点，进行连续的“尾插”尾插，输入的内容是1到一个你自己设定的最大正整数。所有用for()循环函数连续“尾插”即可。
//下面的代码只是完整代码的摘要，文章最后面会给出完整代码
printf("输入最大值：");
scanf("%d",&max);
printf("自动尾插\n");
for ( i = 1; i <= max; i++)
{
kernel_add_tail(head,i);
}
/*=====================================
【函数名称】: kernel_add_tail
【函数功能】: 尾插
=====================================*/
void kernel_add_tail(pkernel_t p,datatype d)
{
//创建新的节点
pkernel_t node = kernel_init();
if(node == NULL)
return;
node->data = d;
//将新的节点插在头的前面
list_add_tail(&node->list,&p->list);
}再来看题目的后半段：“每个节点分别存放1，2，3，4，5，6，7，8，9，10，然后通过某些操作，将其重新排列成1，3，5，7，9，10，8，6，4，2，即奇数升序偶数降序，并在屏幕上打印出来。”
用“Linux内核链表”进行“奇数升序，偶数降序”操作，我们可以采用这种办法来完成这道题：
创建新的头节点，然后替换旧的头节点。在新的头节点上逆序遍历，读取到的数据是奇数就“头插”到旧的头节点，是偶数就“尾插”。最终再遍历旧的头节点。
//下面的代码只是完整代码的摘要，文章最后面会给出完整代码
/*=====================================
【函数名称】: kernel_update_node
【函数功能】: 替换节点
=====================================*/
void kernel_update_node(pkernel_t p,pkernel_t new_node)
{
list_replace_init(&p->list,&new_node->list);
}
/*=====================================
【函数名称】: kernel_sort
【函数功能】: 排序
=====================================*/
void kernel_sort(pkernel_t p_1,pkernel_t p_2)
{
struct list_head *pos = NULL;
pkernel_t node = NULL;
list_for_each_prev(pos, &p_2->list)
{
// 保存该节点
node = list_entry(pos, typeof(*p_1), list);
// pos 手动往后移动
pos = pos->next;
// 奇数做 头插 偶数 做尾插
if (node->data % 2)
// 头插
list_move(&node->list, &p_1->list);
else
// 尾插
list_move_tail(&node->list, &p_1->list);
display(p_1);
}
free(p_2);
}（整些图片示意）
以此类推到最后的结果示意图
运行一下程序看看效果。
下面放出所有代码。
复制完成之后更改相对应的文件名，然后编译代码。
我这边的运行环境是Ubuntu18，使用编译命令：
gcc main.c kernel.c -o app -Wall -O0 -g内核链表头文件
//文件名：list.h
#ifndef _LINUX_LIST_H
#define _LINUX_LIST_H
/*
* Simple doubly linked list implementation.
*
* Some of the internal functions ("__xxx") are useful when
* manipulating whole lists rather than single entries, as
* sometimes we already know the next/prev entries and we can
* generate better code by using them directly rather than
* using the generic single-entry routines.
*/
struct list_head{
struct list_head *next,*prev;
};
#define LIST_POISON1 ((void *) 0x00100100 + 0)
#define LIST_POISON2 ((void *) 0x00200200 + 0)
#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
#define container_of(ptr, type, member) ({ \
const typeof( ((type *)0)->member ) *__mptr = (ptr); \
(type *)( (char *)__mptr - offsetof(type,member) );})
#define LIST_HEAD_INIT(name) { &(name), &(name) }
#define LIST_HEAD(name) \
struct list_head name = LIST_HEAD_INIT(name)
static inline void INIT_LIST_HEAD(struct list_head *list)
{
list->next = list;
list->prev = list;
}
/*
* Insert a new entry between two known consecutive entries.
*
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
#ifndef CONFIG_DEBUG_LIST
static inline void __list_add(struct list_head *new,
struct list_head *prev,
struct list_head *next)
{
next->prev = new;
new->next = next;
new->prev = prev;
prev->next = new;
}
#else
extern void __list_add(struct list_head *new,
struct list_head *prev,
struct list_head *next);
#endif
/**
* list_add - add a new entry
* @new: new entry to be added
* @head: list head to add it after
*
* Insert a new entry after the specified head.
* This is good for implementing stacks.
*/
static inline void list_add(struct list_head *new, struct list_head *head)
{
__list_add(new, head, head->next);
}
/**
* list_add_tail - add a new entry
* @new: new entry to be added
* @head: list head to add it before
*
* Insert a new entry before the specified head.
* This is useful for implementing queues.
*/
static inline void list_add_tail(struct list_head *new, struct list_head *head)
{
__list_add(new, head->prev, head);
}
/*
* Delete a list entry by making the prev/next entries
* point to each other.
*
* This is only for internal list manipulation where we know
* the prev/next entries already!
*/
static inline void __list_del(struct list_head * prev, struct list_head * next)
{
next->prev = prev;
prev->next = next;
}
/**
* list_del - deletes entry from list.
* @entry: the element to delete from the list.
* Note: list_empty() on entry does not return true after this, the entry is
* in an undefined state.
*/
#ifndef CONFIG_DEBUG_LIST
static inline void __list_del_entry(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
}
static inline void list_del(struct list_head *entry)
{
__list_del(entry->prev, entry->next);
entry->next = LIST_POISON1;
entry->prev = LIST_POISON2;
}
#else
extern void __list_del_entry(struct list_head *entry);
extern void list_del(struct list_head *entry);
#endif
/**
* list_replace - replace old entry by new one
* @old : the element to be replaced
* @new : the new element to insert
*
* If @old was empty, it will be overwritten.
*/
static inline void list_replace(struct list_head *old,
struct list_head *new)
{
new->next = old->next;
new->next->prev = new;
new->prev = old->prev;
new->prev->next = new;
}
static inline void list_replace_init(struct list_head *old,
struct list_head *new)
{
list_replace(old, new);
INIT_LIST_HEAD(old);
}
/**
* list_del_init - deletes entry from list and reinitialize it.
* @entry: the element to delete from the list.
*/
static inline void list_del_init(struct list_head *entry)
{
__list_del_entry(entry);
INIT_LIST_HEAD(entry);
}
/**
* list_move - delete from one list and add as another's head
* @list: the entry to move
* @head: the head that will precede our entry
*/
static inline void list_move(struct list_head *list, struct list_head *head)
{
__list_del_entry(list);
list_add(list, head);
}
/**
* list_move_tail - delete from one list and add as another's tail
* @list: the entry to move
* @head: the head that will follow our entry
*/
static inline void list_move_tail(struct list_head *list,
struct list_head *head)
{
__list_del_entry(list);
list_add_tail(list, head);
}
/**
* list_is_last - tests whether @list is the last entry in list @head
* @list: the entry to test
* @head: the head of the list
*/
static inline int list_is_last(const struct list_head *list,
const struct list_head *head)
{
return list->next == head;
}
/**
* list_empty - tests whether a list is empty
* @head: the list to test.
*/
static inline int list_empty(const struct list_head *head)
{
return head->next == head;
}
/**
* list_empty_careful - tests whether a list is empty and not being modified
* @head: the list to test
*
* Description:
* tests whether a list is empty _and_ checks that no other CPU might be
* in the process of modifying either member (next or prev)
*
* NOTE: using list_empty_careful() without synchronization
* can only be safe if the only activity that can happen
* to the list entry is list_del_init(). Eg. it cannot be used
* if another CPU could re-list_add() it.
*/
static inline int list_empty_careful(const struct list_head *head)
{
struct list_head *next = head->next;
return (next == head) && (next == head->prev);
}
/**
* list_rotate_left - rotate the list to the left
* @head: the head of the list
*/
static inline void list_rotate_left(struct list_head *head)
{
struct list_head *first;
if (!list_empty(head)) {
first = head->next;
list_move_tail(first, head);
}
}
/**
* list_is_singular - tests whether a list has just one entry.
* @head: the list to test.
*/
static inline int list_is_singular(const struct list_head *head)
{
return !list_empty(head) && (head->next == head->prev);
}
static inline void __list_cut_position(struct list_head *list,
struct list_head *head, struct list_head *entry)
{
struct list_head *new_first = entry->next;
list->next = head->next;
list->next->prev = list;
list->prev = entry;
entry->next = list;
head->next = new_first;
new_first->prev = head;
}
/**
* list_cut_position - cut a list into two
* @list: a new list to add all removed entries
* @head: a list with entries
* @entry: an entry within head, could be the head itself
* and if so we won't cut the list
*
* This helper moves the initial part of @head, up to and
* including @entry, from @head to @list. You should
* pass on @entry an element you know is on @head. @list
* should be an empty list or a list you do not care about
* losing its data.
*
*/
static inline void list_cut_position(struct list_head *list,
struct list_head *head, struct list_head *entry)
{
if (list_empty(head))
return;
if (list_is_singular(head) &&
(head->next != entry && head != entry))
return;
if (entry == head)
INIT_LIST_HEAD(list);
else
__list_cut_position(list, head, entry);
}
static inline void __list_splice(const struct list_head *list,
struct list_head *prev,
struct list_head *next)
{
struct list_head *first = list->next;
struct list_head *last = list->prev;
first->prev = prev;
prev->next = first;
last->next = next;
next->prev = last;
}
/**
* list_splice - join two lists, this is designed for stacks
* @list: the new list to add.
* @head: the place to add it in the first list.
*/
static inline void list_splice(const struct list_head *list,
struct list_head *head)
{
if (!list_empty(list))
__list_splice(list, head, head->next);
}
/**
* list_splice_tail - join two lists, each list being a queue
* @list: the new list to add.
* @head: the place to add it in the first list.
*/
static inline void list_splice_tail(struct list_head *list,
struct list_head *head)
{
if (!list_empty(list))
__list_splice(list, head->prev, head);
}
/**
* list_splice_init - join two lists and reinitialise the emptied list.
* @list: the new list to add.
* @head: the place to add it in the first list.
*
* The list at @list is reinitialised
*/
static inline void list_splice_init(struct list_head *list,
struct list_head *head)
{
if (!list_empty(list)) {
__list_splice(list, head, head->next);
INIT_LIST_HEAD(list);
}
}
/**
* list_splice_tail_init - join two lists and reinitialise the emptied list
* @list: the new list to add.
* @head: the place to add it in the first list.
*
* Each of the lists is a queue.
* The list at @list is reinitialised
*/
static inline void list_splice_tail_init(struct list_head *list,
struct list_head *head)
{
if (!list_empty(list)) {
__list_splice(list, head->prev, head);
INIT_LIST_HEAD(list);
}
}
/**
* list_entry - get the struct for this entry
* @ptr: the &struct list_head pointer.
* @type: the type of the struct this is embedded in.
* @member: the name of the list_struct within the struct.
*/
#define list_entry(ptr, type, member) \
container_of(ptr, type, member)
/**
* list_first_entry - get the first element from a list
* @ptr: the list head to take the element from.
* @type: the type of the struct this is embedded in.
* @member: the name of the list_struct within the struct.
*
* Note, that list is expected to be not empty.
*/
#define list_first_entry(ptr, type, member) \
list_entry((ptr)->next, type, member)
/**
* list_for_each - iterate over a list
* @pos: the &struct list_head to use as a loop cursor.
* @head: the head for your list.
*/
#define list_for_each(pos, head) \
for (pos = (head)->next; pos != (head); pos = pos->next)
/**
* __list_for_each - iterate over a list
* @pos: the &struct list_head to use as a loop cursor.
* @head: the head for your list.
*
* This variant doesn't differ from list_for_each() any more.
* We don't do prefetching in either case.
*/
#define __list_for_each(pos, head) \
for (pos = (head)->next; pos != (head); pos = pos->next)
/**
* list_for_each_prev - iterate over a list backwards
* @pos: the &struct list_head to use as a loop cursor.
* @head: the head for your list.
*/
#define list_for_each_prev(pos, head) \
for (pos = (head)->prev; pos != (head); pos = pos->prev)
/**
* list_for_each_safe - iterate over a list safe against removal of list entry
* @pos: the &struct list_head to use as a loop cursor.
* @n: another &struct list_head to use as temporary storage
* @head: the head for your list.
*/
#define list_for_each_safe(pos, n, head) \
for (pos = (head)->next, n = pos->next; pos != (head); \
pos = n, n = pos->next)
/**
* list_for_each_prev_safe - iterate over a list backwards safe against removal of list entry
* @pos: the &struct list_head to use as a loop cursor.
* @n: another &struct list_head to use as temporary storage
* @head: the head for your list.
*/
#define list_for_each_prev_safe(pos, n, head) \
for (pos = (head)->prev, n = pos->prev; \
pos != (head); \
pos = n, n = pos->prev)
/**
* list_for_each_entry - iterate over list of given type
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*/
#define list_for_each_entry(pos, head, member) \
for (pos = list_entry((head)->next, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))
/**
* list_for_each_entry_reverse - iterate backwards over list of given type.
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*/
#define list_for_each_entry_reverse(pos, head, member) \
for (pos = list_entry((head)->prev, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.prev, typeof(*pos), member))
/**
* list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue()
* @pos: the type * to use as a start point
* @head: the head of the list
* @member: the name of the list_struct within the struct.
*
* Prepares a pos entry for use as a start point in list_for_each_entry_continue().
*/
#define list_prepare_entry(pos, head, member) \
((pos) ? : list_entry(head, typeof(*pos), member))
/**
* list_for_each_entry_continue - continue iteration over list of given type
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Continue to iterate over list of given type, continuing after
* the current position.
*/
#define list_for_each_entry_continue(pos, head, member) \
for (pos = list_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))
/**
* list_for_each_entry_continue_reverse - iterate backwards from the given point
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Start to iterate over list of given type backwards, continuing after
* the current position.
*/
#define list_for_each_entry_continue_reverse(pos, head, member) \
for (pos = list_entry(pos->member.prev, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.prev, typeof(*pos), member))
/**
* list_for_each_entry_from - iterate over list of given type from the current point
* @pos: the type * to use as a loop cursor.
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Iterate over list of given type, continuing from current position.
*/
#define list_for_each_entry_from(pos, head, member) \
for (; &pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))
/**
* list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
* @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*/
#define list_for_each_entry_safe(pos, n, head, member) \
for (pos = list_entry((head)->next, typeof(*pos), member), \
n = list_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.next, typeof(*n), member))
/**
* list_for_each_entry_safe_continue - continue list iteration safe against removal
* @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Iterate over list of given type, continuing after current point,
* safe against removal of list entry.
*/
#define list_for_each_entry_safe_continue(pos, n, head, member) \
for (pos = list_entry(pos->member.next, typeof(*pos), member), \
n = list_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.next, typeof(*n), member))
/**
* list_for_each_entry_safe_from - iterate over list from current point safe against removal
* @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Iterate over list of given type from current point, safe against
* removal of list entry.
*/
#define list_for_each_entry_safe_from(pos, n, head, member) \
for (n = list_entry(pos->member.next, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.next, typeof(*n), member))
/**
* list_for_each_entry_safe_reverse - iterate backwards over list safe against removal
* @pos: the type * to use as a loop cursor.
* @n: another type * to use as temporary storage
* @head: the head for your list.
* @member: the name of the list_struct within the struct.
*
* Iterate backwards over list of given type, safe against removal
* of list entry.
*/
#define list_for_each_entry_safe_reverse(pos, n, head, member) \
for (pos = list_entry((head)->prev, typeof(*pos), member), \
n = list_entry(pos->member.prev, typeof(*pos), member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.prev, typeof(*n), member))
/**
* list_safe_reset_next - reset a stale list_for_each_entry_safe loop
* @pos: the loop cursor used in the list_for_each_entry_safe loop
* @n: temporary storage used in list_for_each_entry_safe
* @member: the name of the list_struct within the struct.
*
* list_safe_reset_next is not safe to use in general if the list may be
* modified concurrently (eg. the lock is dropped in the loop body). An
* exception to this is if the cursor element (pos) is pinned in the list,
* and list_safe_reset_next is called after re-taking the lock and before
* completing the current iteration of the loop body.
*/
#define list_safe_reset_next(pos, n, member) \
n = list_entry(pos->member.next, typeof(*pos), member)
/*
* Double linked lists with a single pointer list head.
* Mostly useful for hash tables where the two pointer list head is
* too wasteful.
* You lose the ability to access the tail in O(1).
*/
#endif
自定义的头文件
//文件名：kernel.h
#ifndef __KERNEL_H
#define __KERNEL_H 1
#include <stdio.h>
#include "list.h"
typedef int datatype;
typedef struct kernel{
datatype data;
struct list_head list;
} kernel_t,*pkernel_t;
extern pkernel_t kernel_init(void);
extern void kernel_add_head(pkernel_t p,datatype d);
extern void kernel_add_tail(pkernel_t p,datatype d);
extern void kernel_del(pkernel_t p,datatype d);
extern void kernel_update(pkernel_t p,datatype old,datatype new);
extern void display(pkernel_t p);
extern void pre_display(pkernel_t p);
extern void kernel_update_node(pkernel_t p,pkernel_t new_node);
extern void kernel_sort(pkernel_t p_1,pkernel_t p_2);
extern void kernel_sort_2(pkernel_t p_1,pkernel_t p_2);
#endif
自定义功能函数
//文件名：kernel.c
#include "kernel.h"
#include <stdlib.h>
/*=====================================
【函数名称】: kernel_init
【函数功能】: 初始化
=====================================*/
pkernel_t kernel_init(void)
{
//在堆中开辟孔间
pkernel_t p = (pkernel_t)malloc(sizeof(kernel_t));
if(p == NULL)
{
perror("malloc error");
return NULL;
}
//给成员赋值
INIT_LIST_HEAD(&(p->list));
return p;
}
/*=====================================
【函数名称】: kernel_add_head
【函数功能】: 头插
=====================================*/
void kernel_add_head(pkernel_t p,datatype d)
{
//创建新的节点
pkernel_t node = kernel_init();
if(node == NULL)
return;
node->data = d;
//将新的节点插在头的后面
list_add(&node->list,&p->list);
}
/*=====================================
【函数名称】: kernel_add_tail
【函数功能】: 尾插
=====================================*/
void kernel_add_tail(pkernel_t p,datatype d)
{
//创建新的节点
pkernel_t node = kernel_init();
if(node == NULL)
return;
node->data = d;
//将新的节点插在头的前面
list_add_tail(&node->list,&p->list);
}
/*=====================================
【函数名称】: kernel_del
【函数功能】: 删除
=====================================*/
void kernel_del(pkernel_t p,datatype d)
{
struct list_head * pos = NULL;
pkernel_t node = NULL;
// 遍历寻找
/*
#define list_for_each(pos, head) \
for (pos = (head)->next; pos != (head); pos = pos->next)
分析：
正序遍历
@pos ： struct list_head * 中间变量，类似i
@head ： struct list_head * 头结点
*/
list_for_each(pos, &p->list)
{
//通过小结构体得到大结构体指针
node = list_entry(pos, typeof(*p), list);
//判断
if(node->data == d)
{
pos = pos->prev;
// 剪切
list_del_init(&node->list);
// 删除
free(node);
}
}
}
/*=====================================
【函数名称】: kernel_update
【函数功能】: 替换
=====================================*/
void kernel_update(pkernel_t p,datatype old,datatype new)
{
struct list_head * pos = NULL;
pkernel_t node = NULL;
pkernel_t new_node = NULL;
// 遍历寻找 old
list_for_each(pos, &p->list)
{
//通过小结构体得到大结构体指针
node = list_entry(pos, typeof(*p), list);
//找寻old
if(node->data == old)
{
// 找到后 ，创建新节点
new_node = kernel_init();
if(new_node == NULL)
return;
new_node->data = new;
// 新替换旧
list_replace_init(&node->list,&new_node->list);
// 释放旧节点
free(node);
//pos复位
pos = &new_node->list;
}
}
}
/*=====================================
【函数名称】: display
【函数功能】: 正序遍历
=====================================*/
void display(pkernel_t p)
{
pkernel_t pos = NULL;
/*
#define list_for_each_entry(pos, head, member) \
for (pos = list_entry((head)->next, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.next, typeof(*pos), member))
*/
printf("正序遍历结果为:");
list_for_each_entry(pos,&p->list,list)
printf("%d ",pos->data);
printf("\n");
}
/*=====================================
【函数名称】: pre_display
【函数功能】: 逆序遍历
=====================================*/
void pre_display(pkernel_t p)
{
pkernel_t pos = NULL;
/*
#define list_for_each_entry_reverse(pos, head, member) \
for (pos = list_entry((head)->prev, typeof(*pos), member); \
&pos->member != (head); \
pos = list_entry(pos->member.prev, typeof(*pos), member))
*/
printf("逆序遍历结果为:");
list_for_each_entry_reverse(pos,&p->list,list)
printf("%d ",pos->data);
printf("\n");
}
/*=====================================
【函数名称】: kernel_update_node
【函数功能】: 替换节点
=====================================*/
void kernel_update_node(pkernel_t p,pkernel_t new_node)
{
list_replace_init(&p->list,&new_node->list);
}
/*=====================================
【函数名称】: kernel_sort
【函数功能】: 排序
=====================================*/
void kernel_sort(pkernel_t p_1,pkernel_t p_2)
{
struct list_head *pos = NULL;
pkernel_t node = NULL;
list_for_each_prev(pos, &p_2->list)
{
// 保存该节点
node = list_entry(pos, typeof(*p_1), list);
// pos 手动往后移动
pos = pos->next;
// 奇数做 头插 偶数 做尾插
if (node->data % 2)
// 头插
list_move(&node->list, &p_1->list);
else
// 尾插
list_move_tail(&node->list, &p_1->list);
display(p_1);
}
free(p_2);
}
/*=====================================
【函数名称】: kernel_sort_2
【函数功能】: 排序
=====================================*/
void kernel_sort_2(pkernel_t p_1,pkernel_t p_2)
{
pkernel_t pos = NULL;
list_for_each_entry_reverse(pos,&p_2->list,list)
{
if (( pos->data ) % 2 )//判断奇数
{
//将奇数节点插在p_1的后面
kernel_add_head(p_1,pos->data);
}
else
{
//将偶数节点插在p_1的前面
kernel_add_tail(p_1,pos->data);
}
display(p_1);
}
}运行文件
//文件名：main.c
#include "kernel.h"
int main(void)
{
int max,i;
pkernel_t head = kernel_init();
if(head == NULL)
return -1;
printf("head:%p\n",head);
pkernel_t head_2 = kernel_init();
if(head_2 == NULL)
return -1;
printf("head_2:%p\n",head_2);
printf("输入最大值：");
scanf("%d",&max);
printf("自动尾插\n");
for ( i = 1; i <= max; i++)
{
kernel_add_tail(head,i);
}
display(head);
kernel_update_node(head,head_2);
kernel_sort(head,head_2);
return 0;
}
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
