题目
输入一个链表,反转链表后,输出新链表的表头。
代码
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
if(head == null || head.next == null)
return head;
ListNode cur = head;
ListNode pre = null;
ListNode temp = null;
while(cur != null)
{
temp = cur.next;
cur.next = pre;
pre = cur;
cur = temp;
}
return pre;
}
}