练习练习再练习！

分类

总结(3) 读书笔记(1) 题解(7)

/ 注册

全部文章（共7篇）

题解 | #二叉树的深度#

package main import . "nc_tools" /* * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ func Print(root *TreeNo...

Go

2022-03-12

0 318

题解 | #二叉树的深度#

package main import . "nc_tools" /* * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ func TreeDepth(root *Tre...

Go

2022-03-12

0 328

题解 | #二叉树的深度#

package main import . "nc_tools" type TreeNode struct { Val int Left *TreeNode Rigth *TreeNode } func TreeDepth(root *TreeNode ) int { if roo...

Go

2022-03-12

1 272

题解 | #删除链表中重复的结点#

package main import . "nc_tools" /* * type ListNode struct{ * Val int * Next *ListNode * } */ func deleteDuplication(head *ListNode ) *ListNo...

Go

2022-03-12

1 357

题解 | #删除链表的节点#

package main import . "nc_tools" func deleteNode( head *ListNode , val int ) *ListNode { //1.开头 //2.中间、末尾 cur := &ListNode{Val:-1} ...

Go

2022-03-12

0 297

题解 | #合并两个排序的链表#

package main import . "nc_tools" /* * type ListNode struct{ * Val int * Next *ListNode * } */ /** * * @param pHead1 ListNode类 * @param ...

Go

2022-02-28

0 329

题解 | #从尾到头打印链表#

package main import . "nc_tools" type ListNode struct{ Val int Next *ListNode } func printListFromTailToHead( head *ListNode ) (ans []int) { ...

Go

2022-02-28

2 307