pre = null
Next = null
If (node ==null)
Return null
while(node ->next){
next = node->next;
node->next = pre;
pre = node;
node = next;
}
Node->next = pre
Return node;
node为节点,以上为一个函数体
pre = null
Next = null
If (node ==null)
Return null
while(node ->next){
next = node->next;
node->next = pre;
pre = node;
node = next;
}
Node->next = pre
Return node;
node为节点,以上为一个函数体