Documentation
¶
Index ¶
- func CloneComplexList(head *algo.ComplexListNode) *algo.ComplexListNode
- func ConstructBinTree(preOrder []int, inOrder []int) (*algo.TreeNode, error)
- func FindInSortedMatrix(number int, matrix [][]int) bool
- func GetNextTreeNode(node *algo.DoublyTreeNode) *algo.DoublyTreeNode
- func PrintListReversingly(node *algo.ListNode)
- func RepeatedNumber(nums []int) (bool, int)
- func RepeatedNumberII(nums []int) (bool, int)
- type QueueImplWith2Stacks
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func CloneComplexList ¶
func CloneComplexList(head *algo.ComplexListNode) *algo.ComplexListNode
func ConstructBinTree ¶
func FindInSortedMatrix ¶
func GetNextTreeNode ¶
func GetNextTreeNode(node *algo.DoublyTreeNode) *algo.DoublyTreeNode
func PrintListReversingly ¶
func RepeatedNumber ¶
03-01 题目一：找出数组中重复的数字 在一个长度为`n`的数组里的所有数字都在`0 ~ n-1`的范围内。数组中某些数字是重复的，不知道几个数字重复了，也不知道重复了几次。请找出数组中任意一个重复的数字。
func RepeatedNumberII ¶
03-02 题目二：不修改数组找出重复数字 在一个长度为`n+1`的数组里的所有数字都在`1~n`的范围内，所以数组中至少有一个数字是重复的。请找出数组中任意一个重复的数字，但不能修改输入的数组。
Types ¶
type QueueImplWith2Stacks ¶
type QueueImplWith2Stacks struct {
// contains filtered or unexported fields
}
func NewQueueImplWith2Stacks ¶
func NewQueueImplWith2Stacks() *QueueImplWith2Stacks
func (*QueueImplWith2Stacks) Empty ¶
func (q *QueueImplWith2Stacks) Empty() bool
func (*QueueImplWith2Stacks) Len ¶
func (q *QueueImplWith2Stacks) Len() int
func (*QueueImplWith2Stacks) Pop ¶
func (q *QueueImplWith2Stacks) Pop() interface{}
func (*QueueImplWith2Stacks) Push ¶
func (q *QueueImplWith2Stacks) Push(val interface{})
Source Files
Click to show internal directories.
Click to hide internal directories.