请判断一个链表是否为回文链表。
示例 1:
输入: 1->2
输出: false
示例 2:
输入: 1->2->2->1
输出: true
进阶:
你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题?
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func isPalindrome(head *ListNode) bool {
if head == nil ||head.Next==nil{
return true
}
slow := head
fast := head
for fast.Next != nil && fast.Next.Next != nil {
slow = slow.Next
fast = fast.Next.Next
}
last := slow.Next
pre := head
for last.Next != nil {
tmp := last.Next
last.Next = tmp.Next
tmp.Next = slow.Next
slow.Next = tmp
}
for slow.Next != nil {
slow = slow.Next
if pre.Val != slow.Val {
return false
}
pre = pre.Next
}
return true
}