反转单双链表

public class Main {

    //反转单链表(不带头节点)
    public static node reverseList(node head){
        node pre=null;
        node next=null;
        while (head!=null){
            next=head.next;
            head.next=pre;
            pre=head;
            head=next;
        }

        return pre;
    }
    //反转单链表(带头节点)
    public static  node reverseList2(node head){
        node newHead =new node(-1);
        node cur=head.next;
        node next=null;
        while (cur!=null){
            next=cur.next;
            cur.next=newHead.next;
            newHead.next=cur;
            cur=next;
        }
        return newHead;
    }
    //反转双向链表
    public static node reverseList3(node head){
        node pre =null;
        node next=null;
        while (head!=null){
            next=head.next;
            head.next=pre;
            head.last=next;
            pre=head;
            head=next;
        }
        return pre;
    }
}


class node {
    int val;
    node next;
    node last;

    public node(int val) {
        this.val = val;
    }
}