Reverse a singly linked list.
思路:这个应该都会,只是简单的链表转置。就是设置三个指针一个p,一个pleft,一个pright.
代码如下(已通过leetcode)
public class Solution {
public ListNode reverseList(ListNode head) {
ListNode p=head;
ListNode pleft=null;
ListNode pright=null;
while(p!=null) {
pright=p.next;
p.next=pleft;
pleft=p;
p=pright;
}
return pleft;
}
}