#include using namespace std; typedef struct node{ int data; struct node *next; }Node; //怎么样把一个链表掉个顺序 node * convert( Node * head ) { if( head == NULL ) { printf( "empty list!\n"); return NUL

struct int_List_Node{ int value; struct int_List_Node *next; }; //判断两个无环链表是否相交 bool is_crossed( struct int_List_Node * head1 , struct int_List_Node * head2 ) { if( ( head1 == NULL ) || ( head2 ==

//输出单链表倒数第k个结点 struct int_List_Node{ int value; struct int_List_Node *next; }; int count_back_k( const struct int_List_Node * L , const int k ) { struct int_List_Node *p = L; struct int_List_Nod