Versions in this module Expand all Collapse all v1 v1.2.0 Dec 27, 2021 Changes in this version + var AssertOutput = true + var DebugCallIndex int + var DebugTLE = 2 * time.Second + var Once bool + func CompareInf(t *testing.T, inputGenerator, runACFunc, runFunc interface{}) + func CountNodes(root *TreeNode) (cnt int) + func GetParents(root *TreeNode) map[*TreeNode]*TreeNode + func RunLeetCodeClass(t *testing.T, constructor interface{}, rawInputs, rawOutputs []string) error + func RunLeetCodeClassWithCase(t *testing.T, constructor interface{}, rawInputs, rawOutputs []string, ...) (err error) + func RunLeetCodeClassWithExamples(t *testing.T, constructor interface{}, rawExamples [][3]string, ...) (err error) + func RunLeetCodeFunc(t *testing.T, f interface{}, rawInputs [][]string, rawOutputs [][]string) error + func RunLeetCodeFuncWithCase(t *testing.T, f interface{}, rawInputs [][]string, rawOutputs [][]string, ...) (err error) + func RunLeetCodeFuncWithExamples(t *testing.T, f interface{}, rawExamples [][]string, targetCaseNum int) (err error) + func ToGraph(root *TreeNode) [][]int + func ToGraphWithDir(root *TreeNode) [][]DirEdge + func ToWeightedGraph(root *TreeNode) [][]Edge + func Values(head *ListNode) (values []int) + type DirEdge struct + type Edge struct + type Interval struct + End int + Start int + type ListNode struct + Next *ListNode + Val int + 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 struct + Left *Node + Next *Node + Right *Node + Val int + type Point struct + X int + Y int + type TreeNode struct + Left *TreeNode + Right *TreeNode + Val int + func MustBuildTreeNode(rawArray string) *TreeNode