练习练习再练习!
练习练习再练习!
全部文章
题解
总结(3)
读书笔记(1)
归档
标签
去牛客网
登录
/
注册
沧海一粟 | 无名之辈
I can do everthing
全部文章
/ 题解
(共7篇)
题解 | #二叉树的深度#
package main import . "nc_tools" /* * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ func Print(root *TreeNo...
Go
2022-03-12
0
222
题解 | #二叉树的深度#
package main import . "nc_tools" /* * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ func TreeDepth(root *Tre...
Go
2022-03-12
0
220
题解 | #二叉树的深度#
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
167
题解 | #删除链表中重复的结点#
package main import . "nc_tools" /* * type ListNode struct{ * Val int * Next *ListNode * } */ func deleteDuplication(head *ListNode ) *ListNo...
Go
2022-03-12
1
253
题解 | #删除链表的节点#
package main import . "nc_tools" func deleteNode( head *ListNode , val int ) *ListNode { //1.开头 //2.中间、末尾 cur := &ListNode{Val:-1} ...
Go
2022-03-12
0
200
题解 | #合并两个排序的链表#
package main import . "nc_tools" /* * type ListNode struct{ * Val int * Next *ListNode * } */ /** * * @param pHead1 ListNode类 * @param ...
Go
2022-02-28
0
225
题解 | #从尾到头打印链表#
package main import . "nc_tools" type ListNode struct{ Val int Next *ListNode } func printListFromTailToHead( head *ListNode ) (ans []int) { ...
Go
2022-02-28
2
210