<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[s773364的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/s773364</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; s773364]]></copyright><item><title><![CDATA[排列组合1]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/153408887</link><guid>https://blog.youkuaiyun.com/s773364/article/details/153408887</guid><author>s773364</author><pubDate>Thu, 16 Oct 2025 15:50:04 +0800</pubDate><description><![CDATA[让我重新详细地讲解这道题目，并推广到一般性的解决方案，主要利用隔板法（Stars and Bars）和容斥原理（Inclusion-Exclusion Principle）。题目回顾：某高校学生会选拔乡村支教志愿者，初试合格者中：从这三类合格者中选取 K=9K = 9K=9 名志愿者。
限制条件：问就9名志愿者的科目类别构成而言，共有几种挑选方式？一般性问题描述：从 nnn 种不同类型的物品中，每种类型有 NiN_iNi​ 个（i=1,…,ni=1, \dots, ni=1,…,n），选取总共 KKK 个物]]></description><category></category></item><item><title><![CDATA[146. LRU 缓存]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147804156</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147804156</guid><author>s773364</author><pubDate>Thu, 08 May 2025 21:28:52 +0800</pubDate><description><![CDATA[1.每个函数一定要分好自己的功能！！]]></description><category></category></item><item><title><![CDATA[51. N 皇后]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147254248</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147254248</guid><author>s773364</author><pubDate>Tue, 15 Apr 2025 17:26:19 +0800</pubDate><description><![CDATA[斜线上，左上和右上都要遍历。]]></description><category></category></item><item><title><![CDATA[131. 分割回文串]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147253253</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147253253</guid><author>s773364</author><pubDate>Tue, 15 Apr 2025 17:12:56 +0800</pubDate><description><![CDATA[计算回文表，当Index为s的长度时收割，判断是从Index到i。]]></description><category></category></item><item><title><![CDATA[79. 单词搜索]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147251331</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147251331</guid><author>s773364</author><pubDate>Tue, 15 Apr 2025 16:40:03 +0800</pubDate><description><![CDATA[将索引判断和dfs放在同一个判断条件中，只有都为true才返回true；还要恢复现场！]]></description><category></category></item><item><title><![CDATA[22. 括号生成]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147241496</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147241496</guid><author>s773364</author><pubDate>Tue, 15 Apr 2025 15:31:02 +0800</pubDate><description><![CDATA[先回溯左括号，在回溯右括号。]]></description><category></category></item><item><title><![CDATA[39. 组合总和]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147218060</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147218060</guid><author>s773364</author><pubDate>Mon, 14 Apr 2025 12:23:31 +0800</pubDate><description><![CDATA[可重复选取时，Index不用+1，通过sum和target的比较来控制深度。]]></description><category></category></item><item><title><![CDATA[17. 电话号码的字母组合]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147217645</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147217645</guid><author>s773364</author><pubDate>Mon, 14 Apr 2025 12:06:03 +0800</pubDate><description><![CDATA[用index控制深度，但是遍历都从0开始。]]></description><category></category></item><item><title><![CDATA[46. 全排列]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147216722</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147216722</guid><author>s773364</author><pubDate>Mon, 14 Apr 2025 11:57:42 +0800</pubDate><description><![CDATA[排列不用index，但是要used数组。]]></description><category></category></item><item><title><![CDATA[208. 实现 Trie (前缀树)]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147213638</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147213638</guid><author>s773364</author><pubDate>Mon, 14 Apr 2025 11:38:03 +0800</pubDate><description><![CDATA[类外定义节点，类内定义根节点。]]></description><category></category></item><item><title><![CDATA[207. 课程表]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147148519</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147148519</guid><author>s773364</author><pubDate>Fri, 11 Apr 2025 16:49:41 +0800</pubDate><description><![CDATA[先扩容并建立先修课程表，再dfs。]]></description><category></category></item><item><title><![CDATA[994. 腐烂的橘子]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147145497</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147145497</guid><author>s773364</author><pubDate>Fri, 11 Apr 2025 15:56:14 +0800</pubDate><description><![CDATA[加入队列，取出一个，腐化周围，加入腐烂的橘子。]]></description><category></category></item><item><title><![CDATA[200. 岛屿数量]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147136806</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147136806</guid><author>s773364</author><pubDate>Fri, 11 Apr 2025 10:19:10 +0800</pubDate><description><![CDATA[碰到’1’，则dfs；dfs只有碰到’1’才修改。]]></description><category></category></item><item><title><![CDATA[437. 路径总和 III]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147130120</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147130120</guid><author>s773364</author><pubDate>Thu, 10 Apr 2025 23:35:51 +0800</pubDate><description><![CDATA[先计算前缀和，再查找，最后加入，最最后还要去掉！！]]></description><category></category></item><item><title><![CDATA[114. 二叉树展开为链表]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147128214</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147128214</guid><author>s773364</author><pubDate>Thu, 10 Apr 2025 23:22:55 +0800</pubDate><description><![CDATA[左边置空，右边置为head，再将本节点赋给head。]]></description><category></category></item><item><title><![CDATA[199. 二叉树的右视图]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147127676</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147127676</guid><author>s773364</author><pubDate>Thu, 10 Apr 2025 21:35:08 +0800</pubDate><description><![CDATA[通过先遍历右子节点再遍历左子节点来达到右视图的效果。]]></description><category></category></item><item><title><![CDATA[230. 二叉搜索树中第 K 小的元素]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147119428</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147119428</guid><author>s773364</author><pubDate>Thu, 10 Apr 2025 15:17:34 +0800</pubDate><description><![CDATA[用-1标志没找到，再通过返回值将结果传回去，对k进行引用！！！]]></description><category></category></item><item><title><![CDATA[98. 验证二叉搜索树]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147114250</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147114250</guid><author>s773364</author><pubDate>Thu, 10 Apr 2025 11:18:51 +0800</pubDate><description><![CDATA[设置一个pre节点，只有节点不为空时(节点为空时说明当前遍历的是第一个节点)才和当前节点进行比较。]]></description><category></category></item><item><title><![CDATA[108. 将有序数组转换为二叉搜索树]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147113245</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147113245</guid><author>s773364</author><pubDate>Thu, 10 Apr 2025 10:53:30 +0800</pubDate><description><![CDATA[同样只需计算构造左右子树的序列起始值和结束值即可，但是这个比leetcode105简单许多。]]></description><category></category></item><item><title><![CDATA[105. 从前序与中序遍历序列构造二叉树]]></title><link>https://blog.youkuaiyun.com/s773364/article/details/147112031</link><guid>https://blog.youkuaiyun.com/s773364/article/details/147112031</guid><author>s773364</author><pubDate>Thu, 10 Apr 2025 10:48:45 +0800</pubDate><description><![CDATA[主要还是看起始和结束序列的下标怎么算，通常取一个简单的序列带入验证即可。]]></description><category></category></item></channel></rss>