题目——反转链表java版
题目描述
给定单链表的头节点 head ,请反转链表,并返回反转后的链表的头节点。
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:
输入:head = []
输出:[]
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
ListNode cur = head,pre = null;
//如果头结点不为空,一直循环
while(cur!=null){
//用一个零时结点来存储头结点的下一个结点
ListNode temp = cur.next;
//断开连接
cur.next = pre;
//将结点向后移动
pre = cur;
cur = temp;
}
return pre;
}
}