palindrome_lined_list

hitzzc · hitzzc · commit 041262ec9ac4 · 2016-10-18T12:43:05.000+08:00
diff --git a/README.md b/README.md
@@ -189,6 +189,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [230. Kth Smallest Element in a BST](https://github.com/hitzzc/go-leetcode/tree/master/kth_smallest_element_in_a_BST)
 #### [231. Power of Two](https://github.com/hitzzc/go-leetcode/tree/master/power_of_two)
 #### [232. Implement Queue using Stacks](https://github.com/hitzzc/go-leetcode/tree/master/implement_queue_using_stacks)
+#### [234. Palindrome Linked List](https://github.com/hitzzc/go-leetcode/tree/master/palindrome_lined_list)
 
 
 
diff --git a/palindrome_lined_list/palindrome_lined_list.go b/palindrome_lined_list/palindrome_lined_list.go
@@ -0,0 +1,36 @@
+package palindrome_lined_list
+
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+func isPalindrome(head *ListNode) bool {
+	slow, fast := head, head
+	for fast != nil && fast.Next != nil {
+		slow = slow.Next
+		fast = fast.Next.Next
+	}
+	head2 := reverse(slow)
+	for ; head != nil && head2 != nil; head, head2 = head.Next, head2.Next {
+		if head.Val != head2.Val {
+			return false
+		}
+	}
+	return true
+}
+
+func reverse(head *ListNode) (newHead *ListNode) {
+	var pre *ListNode
+	cur := head
+	for cur != nil {
+		tmp := cur.Next
+		cur.Next = pre
+		pre = cur
+		if tmp == nil {
+			break
+		}
+		cur = tmp
+	}
+	return cur
+}
