树相关主要是dfs和bfs，递归万金油常用结构 stack 和queue 占位，刷完来写总结 【111】
发简信
IP属地：北京
-
HTTP，TCP， socket，RPC 与gRPC都是啥？
TCP/HTTP与socket 首先回顾下计算机网络的五(七)层协议：物理层、数据链路层、网络层、传输层、(会话层、表示层)和应用层。那么从协议上来讲： TCP是传输层协议，...
-
【PaperNote】Batch Normalization背景 解决ICS问题。ICS：在深层网络训练的过程中，由于网络中参数变化而引起内部结点数据分布发生变化的这一过程被称作Internal Covariate Shift。（1）...
-
【LeetCode】215. Kth Largest Element in an Array
【Description】Find the kth largest element in an unsorted array. Note that it is the kth...
-
【LeetCode】912. Sort an Array
【Description】Given an array of integers nums, sort the array in ascending order. Exampl...
-
【LeetCode】129. Sum Root to Leaf Numbers
【Description】Given a binary tree containing digits from 0-9 only, each root-to-leaf pat...
-
【LeetCode】113. Path Sum II
【Description】Given a binary tree and a sum, find all root-to-leaf paths where each path...
-
【LeetCode】1325. Delete Leaves With a Given Value
【Description】Given a binary tree root and an integer target, delete all the leaf nodes ...
-
O(n)比较能打。 迭代器思路优化
【LeetCode】102.Binary Tree Level Order Traversal
【Description】 Given a binary tree, return the level order traversal of its nodes' value...
-
107. return res[::-1] 好水
【LeetCode】102.Binary Tree Level Order Traversal
【Description】 Given a binary tree, return the level order traversal of its nodes' value...
-
【LeetCode】102.Binary Tree Level Order Traversal【Description】 Given a binary tree, return the level order traversal of its nodes' value...
-
【LeetCode】572.Subtree of Another Tree
【Description】Given two non-empty binary trees s and t, check whether tree t has exactly...
-
【LeetCode】101. Symmetric Tree【Description】Given a binary tree, check whether it is a mirror of itself (ie, symmetric...
-
【Papernote】常用模型BP推导——FM引： 在MLP线性基础上，引入特征间的交叉?？悸翘卣鞯母呶卣骱拖凳卣?，引入矩阵分解思想来降低特征计算的复杂性。 FM模型具体推导如下。
-
【LeetCode】1302. Deepest Leaves Sum
【Description】Given a binary tree, return the sum of values of its deepest leaves. Examp...
-
【Papernote】ATTENTION IS ALL MY NEED【Mainly Contribution】 attention； mask machines； position embedding； Attention machines ...