Sword finger offer | linked list transpose

Transpose linked list {1,2,3} -> {3,2,1}

Given the head node of a single linked list head, The length is n, After reversing the linked list , Return the header of the new linked list .

public class Solution{
    
   public ListNode ReverseList(ListNode head){
    
        if(head == null){
    
           return null;
        }
        ListNode pre = null;
        ListNode next = head.next;
        while(head != null){
    
           //  Local inversion 
           head.next = pre;
            
          // pre head  All move forward one space 
          pre = head;
          head = next;
          // If head Not empty , resume log next
          if(head !=null){
    
          next = head.next;
        }
   }
   //  At the end of the list , here  1<--2<--3(pre) head = null;
   return pre;
}

---

It's not too late for you to say spring , I'll be in zhenjiangnan .