golang力扣leetcode 234.回文链表

package main
type ListNode struct {
  Val  int
  Next *ListNode
}
func findMiddle(head *ListNode) *ListNode {
  slow := head
  fast := head.Next
  for fast != nil && fast.Next != nil {
    slow = slow.Next
    fast = fast.Next.Next
  }
  return slow
}
func reverseList(head *ListNode) *ListNode {
  curr := head
  var p *ListNode
  for curr != nil {
    next := curr.Next
    curr.Next = p
    p = curr
    curr = next
  }
  return p
}
func isPalindrome(head *ListNode) bool {
  if head == nil {
    return true
  }
  mid := findMiddle(head)
  tail := reverseList(mid.Next)
  for head != nil && tail != nil {
    if head.Val != tail.Val {
      return false
    }
    head = head.Next
    tail = tail.Next
  }
  return true
}
func main() {
}