testutils

Documentation

Index

• Variables
• func CountNodes(root *TreeNode) (cnt int)
• func GetParents(root *TreeNode) map[*TreeNode]*TreeNode
• func IsDebugging() bool
• func RunLeetCodeFuncWithExamples(t *testing.T, f interface{}, rawExamples [][]string, targetCaseNum int) (err error)
• func RunLeetCodeFuncWithFile(t *testing.T, f interface{}, filePath string, targetCaseNum int) error
• func ToGraph(root *TreeNode) [][]int
• func ToGraphWithDir(root *TreeNode) [][]DirEdge
• func ToWeightedGraph(root *TreeNode) [][]Edge
• func Values(head *ListNode) (values []int)
• type DirEdge
• type Edge
• type Interval
• type ListNode
  • func BuildListNodeFromInts(a []int) *ListNode
  • func ModifyNodes(head *ListNode, f func([]int) []int) *ListNode
  • func MustBuildListNode(rawArray string) *ListNode
  • func Nodes(head *ListNode) []*ListNode
• type Node
• type Point
• type TreeNode
  • func MustBuildTreeNode(rawArray string) *TreeNode

Variables

var (
	Once bool

	// DebugCallIndex 用于编写 struct + method 的题目，方便打断点
	DebugCallIndex int

	DebugTLE = 2 * time.Second

	AssertOutput = true
)

Functions

func CountNodes

func CountNodes(root *TreeNode) (cnt int)

func GetParents

func GetParents(root *TreeNode) map[*TreeNode]*TreeNode

func IsDebugging

func IsDebugging() bool

IsDebugging will return true if the process was launched from Delve or the gopls language server debugger.

It does not detect situations where a debugger attached after process start. Adapted from https://stackoverflow.com/a/70969754/4419904

func RunLeetCodeFuncWithExamples

func RunLeetCodeFuncWithExamples(t *testing.T, f interface{}, rawExamples [][]string, targetCaseNum int) (err error)

RunLeetCodeFuncWithExamples rawExamples[i] = 输入+输出，若反射出来的函数或 rawExamples 数据不合法，则会返回一个非空的 error，否则返回 nil

func RunLeetCodeFuncWithFile

func RunLeetCodeFuncWithFile(t *testing.T, f interface{}, filePath string, targetCaseNum int) error

func ToGraph

func ToGraph(root *TreeNode) [][]int

ToGraph 加权图见下面的 ToWeightedGraph

func ToGraphWithDir

func ToGraphWithDir(root *TreeNode) [][]DirEdge

func ToWeightedGraph

func ToWeightedGraph(root *TreeNode) [][]Edge

func Values

func Values(head *ListNode) (values []int)

Types

type DirEdge

type DirEdge struct {
	// contains filtered or unexported fields
}

type Edge

type Edge struct {
	// contains filtered or unexported fields
}

type Interval

type Interval struct {
	Start int
	End   int
}

type ListNode

type ListNode struct {
	Val  int
	Next *ListNode
}

func BuildListNodeFromInts

func BuildListNodeFromInts(a []int) *ListNode

func ModifyNodes

func ModifyNodes(head *ListNode, f func([]int) []int) *ListNode

func MustBuildListNode

func MustBuildListNode(rawArray string) *ListNode

func Nodes

func Nodes(head *ListNode) []*ListNode

type Node

type Node struct {
	Val   int
	Left  *Node
	Right *Node
	Next  *Node
}

Node https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii/

type Point

type Point struct {
	X int
	Y int
}

type TreeNode

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func MustBuildTreeNode

func MustBuildTreeNode(rawArray string) *TreeNode