剑指offer--单链表反转--5

输入一个链表,反转链表后,输出新链表的表头

/*
public class ListNode {
int val;
ListNode next = null;

ListNode(int val) {
    this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
    if(head==null||head.next==null){
        return head;
    }
    ListNode pre=null;
    ListNode next=null;
    while(head!=null){
        next = head.next;
        head.next = pre;
        pre = head;
        head = next;
    }
    return pre;
}
}

猜你喜欢

转载自blog.csdn.net/weixin_44017425/article/details/105310452