64,648
社区成员
发帖
与我相关
我的任务
分享请发表友善的回复…
发表回复
CSam 2005-07-19
- 打赏
- 举报
太强了,真是太好了,谢谢各位!!!
defyer007 2005-07-19
- 打赏
- 举报
可以用异或来实现双链表
foochow 2005-07-19
- 打赏
- 举报
3个指针遍历一遍就可以
llf_hust 2005-07-19
- 打赏
- 举报
struct Node *InvertLinkList(struct Node *p)
{
struct Node *p1,*s;
p1 = p;
p = NULL;
while(p1 != NULL)
{
s = p1;
p1 = p1->next;
s->next = p;
p = s;
}
return p;
}
{
struct Node *p1,*s;
p1 = p;
p = NULL;
while(p1 != NULL)
{
s = p1;
p1 = p1->next;
s->next = p;
p = s;
}
return p;
}
llf_hust 2005-07-19
- 打赏
- 举报
struct Node *(struct Node *p)
{
struct Node *p1,*s;
p1 = p;
p = NULL;
while(p1 != NULL)
{
s = p1;
p1 = p1->next;
s->next = p;
p = s;
}
return p;
}
{
struct Node *p1,*s;
p1 = p;
p = NULL;
while(p1 != NULL)
{
s = p1;
p1 = p1->next;
s->next = p;
p = s;
}
return p;
}
