樹(shù)相關(guān)主要是dfs和bfs，遞歸萬(wàn)金油常用結(jié)構(gòu) stack 和queue 占位，刷完來(lái)寫總結(jié) 【111】
發(fā)簡(jiǎn)信
IP屬地：北京
-
【LeetCode】Tree 合集 - 20230709
-
HTTP，TCP， socket，RPC 與gRPC都是啥？
TCP/HTTP與socket 首先回顧下計(jì)算機(jī)網(wǎng)絡(luò)的五(七)層協(xié)議：物理層、數(shù)據(jù)鏈路層、網(wǎng)絡(luò)層、傳輸層、(會(huì)話層、表示層)和應(yīng)用層。那么從協(xié)議上來(lái)講： TCP是傳輸層協(xié)議，...
-
【PaperNote】Batch Normalization背景 解決ICS問(wèn)題。ICS：在深層網(wǎng)絡(luò)訓(xùn)練的過(guò)程中，由于網(wǎng)絡(luò)中參數(shù)變化而引起內(nèi)部結(jié)點(diǎn)數(shù)據(jù)分布發(fā)生變化的這一過(guò)程被稱作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)比較能打。 迭代器思路優(yōu)化
【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...
-
101.對(duì)稱二叉樹(shù)。 遞歸比較左右節(jié)點(diǎn)的右左值即可，遞歸中發(fā)現(xiàn)不對(duì)稱return False， 對(duì)稱則繼續(xù)向下比較，直到葉子節(jié)點(diǎn)均為空。
二叉樹(shù)題型
-
【Papernote】常用模型BP推導(dǎo)——FM引： 在MLP線性基礎(chǔ)上，引入特征間的交叉?？紤]特征的高維特征和系數(shù)特征，引入矩陣分解思想來(lái)降低特征計(jì)算的復(fù)雜性。 FM模型具體推導(dǎo)如下。
-
【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 ...