algorithm

package

v0.0.0-...-82289f8 Latest Latest Go to latest Published: Jul 30, 2020 License: MIT Imports: 0 Imported by: 0

Details

请判断一个链表是否为回文链表。

示例 1:

输入: 1->2
输出: false

示例 2:

输入: 1->2->2->1
输出: true

进阶：你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题？

This section is empty.

This section is empty.

This section is empty.

type ListNode struct {
	Val  int
	Next *ListNode
}

func Ints2List(nums []int) *ListNode

Ints2List convert []int to List