https://blog.youkuaiyun.com/Stray_Lambszh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Stray_Lambs/article/details/166733899https://blog.youkuaiyun.com/Stray_Lambs/article/details/166733899Stray_LambsSun, 27 Sep 2026 11:18:15 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/166645289https://blog.youkuaiyun.com/Stray_Lambs/article/details/166645289Stray_LambsFri, 25 Sep 2026 18:11:36 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/136191877https://blog.youkuaiyun.com/Stray_Lambs/article/details/136191877Stray_LambsWed, 13 Mar 2024 11:30:46 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/134999082https://blog.youkuaiyun.com/Stray_Lambs/article/details/134999082Stray_LambsSat, 23 Dec 2023 21:20:37 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/134785183https://blog.youkuaiyun.com/Stray_Lambs/article/details/134785183Stray_LambsWed, 06 Dec 2023 18:35:02 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/134780210https://blog.youkuaiyun.com/Stray_Lambs/article/details/134780210Stray_LambsMon, 04 Dec 2023 15:17:41 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/134247226https://blog.youkuaiyun.com/Stray_Lambs/article/details/134247226Stray_LambsMon, 06 Nov 2023 15:58:18 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/134114168https://blog.youkuaiyun.com/Stray_Lambs/article/details/134114168Stray_LambsMon, 30 Oct 2023 14:23:54 +0800>(j+1)\textit{coins}[i]>>(j+1)coins[i]>>(j+1) 加上每个子树 ch\textit{ch}ch 的 dfs(ch,j+1)\textit{dfs}(ch,j+1)dfs(ch,j+1)。因为 k == 1 ，数组的 1-or 等于其中所有元素按位或运算的结果。长度大于或等于 3 的子数组为 [2,4,0], [4,0,0], [0,0,4], [2,4,0,0], [4,0,0,4], [2,4,0,0,4]。]]>https://blog.youkuaiyun.com/Stray_Lambs/article/details/134009073https://blog.youkuaiyun.com/Stray_Lambs/article/details/134009073Stray_LambsTue, 24 Oct 2023 14:43:39 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/133923321https://blog.youkuaiyun.com/Stray_Lambs/article/details/133923321Stray_LambsThu, 19 Oct 2023 11:50:21 +0800 b = d，所以若 a = c，则 b = d。说白了，其实就是根据给定的nums数组，每个元素两两相乘，遍历一次，记录乘积的个数，然后个数大于2的，根据排列组合公式，从可选组合中选取2个。首先，我们可以从答案上推断出，只要有一组符合的答案，比如 2*3 = 4*6，根据换不同的位置，可以知道，最终的答案就是4元组的个数 * 8。]]>https://blog.youkuaiyun.com/Stray_Lambs/article/details/133794233https://blog.youkuaiyun.com/Stray_Lambs/article/details/133794233Stray_LambsTue, 17 Oct 2023 15:43:38 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/133088688https://blog.youkuaiyun.com/Stray_Lambs/article/details/133088688Stray_LambsSun, 08 Oct 2023 16:53:14 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/132544770https://blog.youkuaiyun.com/Stray_Lambs/article/details/132544770Stray_LambsFri, 22 Sep 2023 15:50:22 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/132733110https://blog.youkuaiyun.com/Stray_Lambs/article/details/132733110Stray_LambsThu, 07 Sep 2023 10:58:28 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/132540998https://blog.youkuaiyun.com/Stray_Lambs/article/details/132540998Stray_LambsMon, 28 Aug 2023 16:03:37 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/132524518https://blog.youkuaiyun.com/Stray_Lambs/article/details/132524518Stray_LambsSun, 27 Aug 2023 16:42:22 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/132495193https://blog.youkuaiyun.com/Stray_Lambs/article/details/132495193Stray_LambsFri, 25 Aug 2023 14:47:16 +0800 (3, 3, 2) 不是好节点，因为 "3" 比它大。节点 5 -> (3,4,5) 是路径中的最大值。节点 3 -> (3,1,3) 是路径中的最大值。节点 4 -> (3,4) 是路径中的最大值。的二叉树，请你返回二叉树中好节点的数目。根节点 (3) 永远是个好节点。图中蓝色节点为好节点。]]>https://blog.youkuaiyun.com/Stray_Lambs/article/details/132481630https://blog.youkuaiyun.com/Stray_Lambs/article/details/132481630Stray_LambsThu, 24 Aug 2023 20:02:58 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/132477502https://blog.youkuaiyun.com/Stray_Lambs/article/details/132477502Stray_LambsThu, 24 Aug 2023 16:39:18 +0800https://blog.youkuaiyun.com/Stray_Lambs/article/details/132428159https://blog.youkuaiyun.com/Stray_Lambs/article/details/132428159Stray_LambsTue, 22 Aug 2023 15:05:45 +0800