Commit b646602

committed

add 234

1 parent 46c3ab2 commit b646602Copy full SHA for b646602

File tree

+48

-0

lines changed

+48

-0

lines changed

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+`
	`2`	`+# 0234.palindrome-linked-list`
	`3`	`+`
	`4`	+```text
	`5`	`+请判断一个链表是否为回文链表。`
	`6`	`+`
	`7`	`+示例 1:`
	`8`	`+`
	`9`	`+输入: 1->2`
	`10`	`+输出: false`
	`11`	`+示例 2:`
	`12`	`+`
	`13`	`+输入: 1->2->2->1`
	`14`	`+输出: true`
	`15`	`+进阶:`
	`16`	`+你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题?`
	`17`	`+`
	`18`	`+来源:力扣(LeetCode)`
	`19`	`+链接:https://leetcode-cn.com/problems/palindrome-linked-list`
	`20`	`+著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。`
	`21`	+```

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,19 @@`
	`1`	`+package list`
	`2`	`+`
	`3`	`+import "github.com/itcuihao/leetcode-go/structure"`
	`4`	`+`
	`5`	`+func Run() {`
	`6`	`+`
	`7`	`+}`
	`8`	`+`
	`9`	`+/**`
	`10`	`+ * Definition for singly-linked list.`
	`11`	`+ * type ListNode struct {`
	`12`	`+ * Val int`
	`13`	`+ * Next *ListNode`
	`14`	`+ * }`
	`15`	`+ */`
	`16`	`+func isPalindrome(head *structure.ListNode) bool {`
	`17`	`+`
	`18`	`+ return false`
	`19`	`+}`

Lines changed: 8 additions & 0 deletions

Comments

(0)