反转链表
题目
思路:
从头遍历,将结点从原拆解下来加在新链表的后面.
代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
if(head==null||head.next==null)
return head;
ListNode p = head.next;
head.next=null;
while(p.next!=null)
{
ListNode q = p.next;
p.next=head;
head=p;
p=q;
}
p.next=head;
return p;
}
}