题目描述:
请判断一个链表是否为回文链表。
示例 1:
输入: 1->2
输出: false
示例 2:
输入: 1->2->2->1
输出: true
进阶:
你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题?
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/palindrome-linked-list
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解法:
class Solution {
public boolean isPalindrome(ListNode head) {
if(head == null || head.next == null){
return true;
}
ListNode fast = head.next;
ListNode slow = head;
while (fast != null && fast.next != null){
fast = fast.next.next;
slow = slow.next;
}
fast = slow.next;
slow.next = null;
ListNode help= null;
while (fast != null){//反转后半部分
help = fast.next;
fast.next = slow;
slow = fast;
fast = help;
}
help = slow;//help 记录末尾位置
fast = head;
boolean res = true;
while (slow != null && fast != null){
if(fast.val != slow.val){
res = false;
}
slow = slow.next;
fast = fast.next;
}
slow = help.next;
help.next = null;
while (slow != null){//将链表还原
fast = slow.next;
slow.next = help;
help = slow;
slow = fast;
}
return res;
}
}