package com.daily.daily20210204;
/**
* @Project: dailyCode
* @Site: http://www.zhao1iang.club/
* @Copyright: ©CodeLamp
* @Author: zhaoliang
* @Create: 2021-02-04 15:24
* @Desc: 反转链表
**/
public class ReverseList {
//输入一个链表,反转链表后,输出新链表的表头。
class ListNode{
int val;
ListNode next;
ListNode(int x){
this.val = x;
}
}
public ListNode reverseList(ListNode head){
ListNode newHead = new ListNode(-1);
while (head!=null){
ListNode next = head.next;
head.next = newHead.next;
newHead.next = head;
head = next;
}
return newHead.next;
}
}
日常刷题-反转链表
最新推荐文章于 2024-09-20 15:09:03 发布