/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
//空表或链表长度为1
if(head == null || head.next == null)
return head;
ListNode preLN = null;//前结点
ListNode nextLN = null;//next结点
while(head != null){
nextLN = head.next;//保存当前结点的next结点,防止链表断裂
head.next = preLN;//翻转链表当前结点指向
preLN = head;//当前结点成为前结点,
head = nextLN;//链表右移,继续处理原链表的下一个结点
}
return preLN;
}
}