Write a list inversion algorithm.

You never know how low you are before you get hit in an interview. In fact, it’s not that you’re less skilled than others. It’s just the skills of the interview. When you go to a big company for an interview, you’ll ask your algorithm if you think it’s OK after a few words. The algorithm is not very useful in normal work, but it can be tested.Personal ability, first of all, write a list inversion algorithm.

    public ListNode reverseList(ListNode head) {
        ListNode first = null;
        ListNode current = head;
        ListNode next = null;
        while(current!=null){
            next = current.next;
            current.next= first;
            first = current;
            current = next;
        }
        return first;
    }