单向链表反转

public class Test5 {

    static class ListNode {  //链表
        int val;
        ListNode next;

        //构造器
        public ListNode(int val, ListNode next) {

            this.val = val;
            this.next = next;
        }
    }

    public static void main(String[] args){
        ListNode node5 = new ListNode(5,null);
        ListNode node4 = new ListNode(4,node5);
        ListNode node3 = new ListNode(3,node4);
        ListNode node2 = new ListNode(2,node3);
        ListNode node1 = new ListNode(1,node2);
        ListNode prev = iterate(node1);
        while(prev!= null){
            System.out.println(prev.val);
            prev = prev.next;
        }

    }
    //链表迭代
    public static ListNode iterate(ListNode head){

        ListNode pre=null,next,curr=head;

        while (curr!=null){
            next = curr.next;
            curr.next = pre;
            pre = curr;
            curr = next;
        }

        return pre;
        }
}