链表逆置
//链表逆置 (带头结点)
public void reset(){
Node2 p,q;
p = head.next;
head.next = null;
while(p != null){
q = p;
p = p.next;
q.next = head.next;
head.next = q;
}
}
//链表逆置 (不带头结点)
/*
public ListNode ReverseList(ListNode head){
ListNode Pre = null; //始终保存前面断掉的链表的头指针
ListNode Cur = head; //当前处理的节点
ListNode pReserve = null; //保存当前节点的下一个节点,防止断掉了
while ( Cur != null)
{
pReserve = Cur.next;
Cur.next = Pre;
Pre = Cur;
Cur = pReserve;
}
return Pre;
}
*/