Merge pull request 6boris#236 from 0xff-dev/master

Add solution and test-cases for problem 234

Author: 6boris

leetcode/201-300/0234.Palindrome-Linked-List/README.md

@@ -1,28 +1,23 @@
 # [234.Palindrome Linked List][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+Given the `head` of a singly linked list, return true if it is a palindrome.
 
-**Example 1:**
+**Example 1:**  
+![exampl1](pal1linked-list.jpg)
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: head = [1,2,2,1]
+Output: true
 ```
 
-## 题意
-> ...
-
-## 题解
+**Example 2:**  
+![example2](pal2linked-list.jpg)
 
-### 思路1
-> ...
-Palindrome Linked List
-```go
 ```
-
+Input: head = [1,2]
+Output: false
+```
 
 ## 结语
 

leetcode/201-300/0234.Palindrome-Linked-List/Solution.go

@@ -1,5 +1,18 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(head *ListNode) bool {
+	walk := head
+	r := true
+	isPalindromeAux(head, &walk, &r)
+	return r
+}
+func isPalindromeAux(head *ListNode, tail **ListNode, r *bool) {
+	if head == nil {
+		return
+	}
+	isPalindromeAux(head.Next, tail, r)
+	res := head.Val == (*tail).Val
+
+	*r = *r && res
+	*tail = (*tail).Next
 }

leetcode/201-300/0234.Palindrome-Linked-List/Solution_test.go

@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
+		inputs *ListNode
 		expect bool
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", &ListNode{1, &ListNode{2, &ListNode{2, &ListNode{1, nil}}}}, true},
+		{"TestCase2", &ListNode{1, &ListNode{2, nil}}, false},
+		{"TestCase3", &ListNode{Val: 1}, true},
 	}
 
 	//	开始测试

leetcode/201-300/0234.Palindrome-Linked-List/pal1linked-list.jpg

@@ -0,0 +1,6 @@
+package Solution
+
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}