(ListNode pre, ListNode next)
| 27 | } |
| 28 | |
| 29 | private ListNode reverse(ListNode pre, ListNode next) { |
| 30 | ListNode head = pre.next; |
| 31 | ListNode move = head.next; |
| 32 | while (move != next) { |
| 33 | head.next = move.next; |
| 34 | move.next = pre.next; |
| 35 | pre.next = move; |
| 36 | move = head.next; |
| 37 | } |
| 38 | return head; |
| 39 | } |
| 40 | |
| 41 | public static void main(String[] args) { |
| 42 | Solution solution = new Solution(); |