topic024

package

v0.0.0-...-b071cee Latest Latest Go to latest Published: Aug 9, 2023 License: GPL-3.0 Imports: 2 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/CodeHanHan/leetcode-go

Links

Open Source Insights

README ¶

两两交换链表中的节点

1. 题目描述

给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。

你不能只是单纯的改变节点内部的值，而是需要实际的进行节点交换。

2. 示例

示例1

输入：head = [1,2,3,4]
输出：[2,1,4,3]

示例2

输入：head = []
输出：[]

示例3

输入：head = [1]
输出：[1]

3. 解题

逐个交换即可

Documentation ¶

Index ¶

type ListNode

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type ListNode ¶

type ListNode struct {
	Val  int
	Next *ListNode
}

func BuildCircleListWithNoHead ¶

func BuildCircleListWithNoHead(list []int, cursor int) *ListNode

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

func BuildListWithHead ¶

func BuildListWithHead(data []int) *ListNode

func BuildListWithNoHead ¶

func BuildListWithNoHead(nums []int) *ListNode

func (*ListNode) HasCycle ¶

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 (*ListNode) Index ¶

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

Index return the node which value equals target

func (*ListNode) Len ¶

func (l *ListNode) Len() int

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

func (*ListNode) Slice ¶

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

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

func (*ListNode) String ¶

func (l *ListNode) String() string

String implements Stringer interface.

func (*ListNode) Tail ¶

func (l *ListNode) Tail() *ListNode

Tail return last list node

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL