goden0201

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 ¶

面试题 02.01.移除重复节点

1. 题目描述

编写代码，移除未排序链表中的重复节点。保留最开始出现的节点。

示例1:


 输入：[1, 2, 3, 3, 2, 1]
 输出：[1, 2, 3]

示例2:


 输入：[1, 1, 1, 1, 2]
 输出：[1, 2]

提示：

链表长度在[0, 20000]范围内。
链表元素在[0, 20000]范围内。 进阶：

如果不得使用临时缓冲区，该怎么解决？

标签 哈希表 链表 双指针

2. 解题

使用map记录节点是否出现，若未出现过，则将其加入新链表，若出现过，则跳过当前节点

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