Question

求大神指教！！！数据结构题，求程序，及测试结果截图！！！我做了怎么都不对！急急急。。。

设C={a1,b1,a2,b2,……,an,bn}为一线性表，采用带头结点的Hc单链表存放，编写一个就地算法，将其拆分成两个线性表，使得：A={a1,a2,…..,an} C={b1,b2,….,bn}

Answer 1

不知道这样是不是符合你的要求：（代码只是简单写了，没经过任何验证检查）
typedef struct tagNode
{
int data;
struct tagNode *pNext;
}Node_t, *NodeP_t;
int split_link(NodeP_t source, NodeP_t* dest1, NodeP_t* dest2)
{
NodeP_t cur_node = source->pNext;
NodeP_t d1 = (NodeP_t)malloc(sizeof(Node_t));
NodeP_t d2 = (NodeP_t)malloc(sizeof(Node_t));
*dest1 = d1;
d1->pNext = NULL;
*dest2 = d2;
d2->pNext = NULL;
while (cur_node)
{
d1->pNext = (NodeP_t)malloc(sizeof(Node_t));
d1->pNext->data = cur_node->data;
d1 = d1->pNext;
cur_node = cur_node->pNext;
if (cur_node)
{
d2->pNext = (NodeP_t)malloc(sizeof(Node_t));
d2->pNext->data = cur_node->data;
d2 = d2->pNext;
cur_node = cur_node->pNext;
}
}
d1->pNext = NULL;
d2->pNext = NULL;
return 1;
}