https://blog.youkuaiyun.com/qq_45600779zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/qq_45600779/article/details/131872264https://blog.youkuaiyun.com/qq_45600779/article/details/131872264qq_45600779Mon, 24 Jul 2023 17:08:07 +0800https://blog.youkuaiyun.com/qq_45600779/article/details/131838988https://blog.youkuaiyun.com/qq_45600779/article/details/131838988qq_45600779Sat, 22 Jul 2023 16:16:01 +0800https://blog.youkuaiyun.com/qq_45600779/article/details/131731404https://blog.youkuaiyun.com/qq_45600779/article/details/131731404qq_45600779Thu, 20 Jul 2023 20:11:33 +0800https://blog.youkuaiyun.com/qq_45600779/article/details/131501385https://blog.youkuaiyun.com/qq_45600779/article/details/131501385qq_45600779Fri, 14 Jul 2023 21:06:50 +0800https://blog.youkuaiyun.com/qq_45600779/article/details/131484455https://blog.youkuaiyun.com/qq_45600779/article/details/131484455qq_45600779Sun, 02 Jul 2023 15:24:06 +0800https://blog.youkuaiyun.com/qq_45600779/article/details/131342300https://blog.youkuaiyun.com/qq_45600779/article/details/131342300qq_45600779Fri, 30 Jun 2023 22:10:00 +0800当前字符，则前一个字符-1，flag=当前位置。若左右节点都为2，则返回0；若左右节点有一个为1，则返回2；若左右节点有一个为0，则返回1。先确定每个字母出现的最后位置，若当前最大位置==当前坐标，则按照规则加入返回值。先排序再遍历，若当前区间超出先前区间r+1，若未超出则修改缩减当前区间。后序遍历，未覆盖=0，已覆盖=2，有监控=1。]]>https://blog.youkuaiyun.com/qq_45600779/article/details/131091708https://blog.youkuaiyun.com/qq_45600779/article/details/131091708qq_45600779Thu, 22 Jun 2023 16:19:25 +0800https://blog.youkuaiyun.com/qq_45600779/article/details/131055521https://blog.youkuaiyun.com/qq_45600779/article/details/131055521qq_45600779Wed, 07 Jun 2023 16:20:05 +0800https://blog.youkuaiyun.com/qq_45600779/article/details/130795533https://blog.youkuaiyun.com/qq_45600779/article/details/130795533qq_45600779Wed, 24 May 2023 21:46:28 +0800target即return。剪枝：for循环中范围值剪枝，sum大小剪枝。剪枝：sum+i > target则结束循环。纵向：3（最后一段判断是否合法）注：candidates要排序。纵向：起始位置>=目标串长度。]]>https://blog.youkuaiyun.com/qq_45600779/article/details/130770820https://blog.youkuaiyun.com/qq_45600779/article/details/130770820qq_45600779Fri, 19 May 2023 20:40:39 +0800返回其右子树递归；删右节点->返回其左子树递归。单层逻辑：root.val < val，递归右子树；5.若删除节点左空右空->右节点替代，左节点置于右子树最左节点的左节点。若root.val右节点替代。4.若删除节点左非空右空->左节点替代。终止条件：若为空，返回目标值新节点。2.若删除节点是叶子节点->直接删。终止条件：空节点->空。]]>https://blog.youkuaiyun.com/qq_45600779/article/details/130756103https://blog.youkuaiyun.com/qq_45600779/article/details/130756103qq_45600779Fri, 19 May 2023 17:13:01 +0800返回本身；左右自身均有返回值->返回本身。中序遍历求最小差，最大整数值 float(“inf”)中序遍历，记录上一节点。中序遍历结果是递增的。]]>https://blog.youkuaiyun.com/qq_45600779/article/details/130672595https://blog.youkuaiyun.com/qq_45600779/article/details/130672595qq_45600779Thu, 18 May 2023 21:23:08 +0800找根节点在中序数组中的位置->将中序数组分出左右子树->根据。对于每个节点，返回当前点的左叶子值+左子树的左叶子和+右子树的左叶子和。3.单层逻辑：判断当前节点的左节点是否为左叶子，若是则加入结果值；终止条件：空节点返回None，中序数组长度为一时返回该节点。单层逻辑：如果有左子树，深度加一，递归，回溯；注意变量作用域、浅拷贝与深拷贝。2.终止条件：空节点，返回0。]]>https://blog.youkuaiyun.com/qq_45600779/article/details/130662867https://blog.youkuaiyun.com/qq_45600779/article/details/130662867qq_45600779Sun, 14 May 2023 19:32:38 +0800左递归、路径回退；if右->右递归、路径回退。3.单层逻辑：比较左子树的右与右子树的左&&左的左与右的右。2.终止条件：左右均空为真，一空为假，异值为假。方法一：深度，层序遍历，遇到叶子节点则返回层数。1.参数：左子树和右子树，返回值：布尔值。前序遍历、层序遍历求深度；，左非0右非0->min(左，右)+1。2.终止条件：叶子节点->加入结果路径。1.参数：节点、路径、结果集。方法一：层序遍历，数节点数。方法二：高度，递归，递归后序遍历求高度，]]>https://blog.youkuaiyun.com/qq_45600779/article/details/130642051https://blog.youkuaiyun.com/qq_45600779/article/details/130642051qq_45600779Sun, 14 May 2023 19:30:48 +0800