goden0206

package

v0.0.0-...-b071cee Latest Latest Go to latest Published: Aug 9, 2023 License: GPL-3.0 Imports: 2 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 BuildCircleListWithNoHead(list []int, cursor int) *ListNode

BuildCircleListWithNoHead build a circle list, which tail point to list[cursor]

func BuildListWithHead(data []int) *ListNode

func BuildListWithNoHead(nums []int) *ListNode

func (l *ListNode) HasCycle() (bool, *ListNode)

HasCycle check if linklist has cycle structure, if not, return false, nil, if yes, return true and the cycle start node

func (l *ListNode) Index(target int) *ListNode

Index return the node which value equals target

func (l *ListNode) Len() int

Len return list length, when list has cycle structure, return -1

func (l *ListNode) Slice() []int

Slice return slice which contains all node's values in order.

func (l *ListNode) String() string

String implements Stringer interface.

func (l *ListNode) Tail() *ListNode

Tail return last list node