<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[TIMELIMITE的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/TIMELIMITE</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; TIMELIMITE]]></copyright><item><title><![CDATA[leetcode 1233 前缀字典树]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125694347</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125694347</guid><author>TIMELIMITE</author><pubDate>Sat, 09 Jul 2022 15:33:33 +0800</pubDate><description><![CDATA[前缀字典树]]></description><category></category></item><item><title><![CDATA[leetcode895 最大频次栈 hashmap]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125586997</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125586997</guid><author>TIMELIMITE</author><pubDate>Sun, 03 Jul 2022 17:36:36 +0800</pubDate><description><![CDATA[leetcode895 最大频次栈， hashmap应用]]></description><category></category></item><item><title><![CDATA[Leetcode 460 LFU缓存机制（最低频次最少使用）]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125580304</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125580304</guid><author>TIMELIMITE</author><pubDate>Sun, 03 Jul 2022 01:27:11 +0800</pubDate><description><![CDATA[LFU缓存机制，比LRU缓存更加复杂，具体为当需要移除key时，需要删除频次最低的key，而当频次最低key有多个时，删除最久未使用的key，]]></description><category></category></item><item><title><![CDATA[Leetcode 380 随机获取的数据结构]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125579329</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125579329</guid><author>TIMELIMITE</author><pubDate>Sat, 02 Jul 2022 23:12:20 +0800</pubDate><description><![CDATA[使用数组+hashmap，O(1) 获取数据，O(1) 删除数据]]></description><category></category></item><item><title><![CDATA[Leetcode 146 缓存算法 hashmap+双向链表]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125578393</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125578393</guid><author>TIMELIMITE</author><pubDate>Sat, 02 Jul 2022 22:00:23 +0800</pubDate><description><![CDATA[Leetcode 146 缓存算法 hashmap+双向链表]]></description><category></category></item><item><title><![CDATA[Leetcode 703 数据流中的第k大元素 堆]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125577525</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125577525</guid><author>TIMELIMITE</author><pubDate>Sat, 02 Jul 2022 20:51:40 +0800</pubDate><description><![CDATA[数据流中的第k大元素 使用堆]]></description><category></category></item><item><title><![CDATA[Leetcode 295 数据流中的中位数]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125577310</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125577310</guid><author>TIMELIMITE</author><pubDate>Sat, 02 Jul 2022 20:30:53 +0800</pubDate><description><![CDATA[在数据流中寻找中位数]]></description><category></category></item><item><title><![CDATA[LeetCode 23 合并k个排序链表 优先队列堆优化]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125576809</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125576809</guid><author>TIMELIMITE</author><pubDate>Sat, 02 Jul 2022 19:35:07 +0800</pubDate><description><![CDATA[优先队列堆优化]]></description><category></category></item><item><title><![CDATA[LeetCode 51 N皇后 回溯]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125560356</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125560356</guid><author>TIMELIMITE</author><pubDate>Fri, 01 Jul 2022 15:52:58 +0800</pubDate><description><![CDATA[n皇后回溯法]]></description><category></category></item><item><title><![CDATA[leetcode 394 解压字符串 栈]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125494092</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/125494092</guid><author>TIMELIMITE</author><pubDate>Mon, 27 Jun 2022 23:56:44 +0800</pubDate><description><![CDATA[栈的基本操作]]></description><category></category></item><item><title><![CDATA[1202. 交换字符串中的元素 并查集+排序]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124455960</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124455960</guid><author>TIMELIMITE</author><pubDate>Wed, 27 Apr 2022 17:21:18 +0800</pubDate><description><![CDATA[// 将同一个联通部分的字符拿出来, sort下
// 然后逐个填入....

class Solution {
    private int[] father;

    public int find(int x) {
        if (x == father[x])
            return x;
        return father[x] = find(father[x]);
    }

    public void union(int u, int v) {
   .]]></description><category></category></item><item><title><![CDATA[316 & 1081. 去除重复字母 (单调栈)]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124450713</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124450713</guid><author>TIMELIMITE</author><pubDate>Wed, 27 Apr 2022 14:41:59 +0800</pubDate><description><![CDATA[// 如果不需要保持原有顺序的话,直接一个set就行了
// 但需要保存顺序就是用单调栈了
// 栈中元素单调, 每来一个字符c, 
// 判断是否栈中存在, 存在直接pass
// 不存在, 就与栈中字符比较, 如果栈顶字符比c大,并且后续仍会出现
// 就将栈顶元素弹出, 更新标记
// 最后栈中所有字符就是最终答案, 逆序输出即可

class Solution {
    public String smallestSubsequence(String s) {
        ArrayDequ.]]></description><category></category></item><item><title><![CDATA[1541. 平衡括号字符串的最少插入次数 栈]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124447883</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124447883</guid><author>TIMELIMITE</author><pubDate>Wed, 27 Apr 2022 12:08:01 +0800</pubDate><description><![CDATA[// "(" 进栈
// "))" 两种情况: 栈为空, 添加一个'('计数+1 不为空直接弹出
// ")" 两种情况:
// 栈为空, 所以必须加个"()" 计数+2
// 栈不为空, 必须加个')' 计数+1
// 最后统计栈中'('的数量

class Solution {

    public boolean match(char a, char b) {
        if (a == '(' &amp;&amp; b == ')')
            return true;
  .]]></description><category></category></item><item><title><![CDATA[921. 使括号有效的最少添加 栈]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124447527</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124447527</guid><author>TIMELIMITE</author><pubDate>Wed, 27 Apr 2022 11:48:22 +0800</pubDate><description><![CDATA[栈的使用]]></description><category></category></item><item><title><![CDATA[leetcode 92 反转链表 II O(n)]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124231663</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124231663</guid><author>TIMELIMITE</author><pubDate>Sun, 17 Apr 2022 16:27:04 +0800</pubDate><description><![CDATA[// 从前往后遍历, 保留left前一个节点pre位置, 保留right后一个节点的位置q
// 同时保留lef所在的位置rTail, 保留right所在位置p
// 翻转left到right的链表
// 把p接到pre后面,把q接到rTail后面
// 特判pre是否为null, 此时head可能是q的位置
// 细节特别多
// 完事儿

class Solution {

    public int n;

    public ListNode reverseBetween(ListNode h.]]></description><category></category></item><item><title><![CDATA[201 数字范围按位与 二进制转换]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124088531</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124088531</guid><author>TIMELIMITE</author><pubDate>Sun, 10 Apr 2022 23:22:03 +0800</pubDate><description><![CDATA[// 如果left和right不在同一个[2^i, 2^(i + 1)]范围内一定是0
// 因为此时按照二进制分解left高位是0, 而区间内肯定有高位是1后面全0的数
// 比如5, 9 左边left为0101, 区间内有8,其二进制形式为1000
// 在同一个范围时, 看高位有多少个相同的1,累加即可
// 更好的是不断去除末位的1

class Solution {
public:

    int rangeBitwiseAnd(int left, int right) {

        .]]></description><category></category></item><item><title><![CDATA[leetcode 300 最长递增子序列 动态规划+二分优化]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124074991</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124074991</guid><author>TIMELIMITE</author><pubDate>Sun, 10 Apr 2022 11:18:02 +0800</pubDate><description><![CDATA[// 经典dp
// dp[i]表示以i为结尾的最长公共子序列长度
// dp[i] = max(dp[j]) + 1 if (a[i] &gt; a[j])
// 否则dp[i] = 1
// 优化版在后面

//class Solution {
//public:
//    int lengthOfLIS(vector&lt;int&gt;&amp; nums) {
//        int n = nums.size();
//        vector&lt;int&gt; dp(n + 1.]]></description><category></category></item><item><title><![CDATA[leetcode 139 单词拆分 一维dp]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124073729</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124073729</guid><author>TIMELIMITE</author><pubDate>Sun, 10 Apr 2022 10:18:58 +0800</pubDate><description><![CDATA[// dp[i]表示1到i是否能拼成
// dp[i] = dp[i] | dp[j] if (j, i)能找到单词匹配
class Solution {
public:

    bool wordBreak(string s, vector&lt;string&gt;&amp; wordDict) {
        int n = s.length();
        vector&lt;bool&gt; dp(n + 1);
        dp[0] = true;
        for (.]]></description><category></category></item><item><title><![CDATA[leetcode 91 解码方法 动态规划 递推]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124071710</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124071710</guid><author>TIMELIMITE</author><pubDate>Sun, 10 Apr 2022 01:42:22 +0800</pubDate><description><![CDATA[// 各种特殊情况处理
// 选择从右往左,从左往右也是一样

class Solution {
public:
    int numDecodings(string s) {
        int n = s.length();
        if (s[0] == '0') return 0;
        vector&lt;int&gt; dp(n);
        dp[n - 1] = 1;
        for (int i = n - 2; i &gt;= 0; i--) {
.]]></description><category></category></item><item><title><![CDATA[leetcode 413 等差数列划分 动态规划 简单递推]]></title><link>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124071458</link><guid>https://blog.youkuaiyun.com/TIMELIMITE/article/details/124071458</guid><author>TIMELIMITE</author><pubDate>Sun, 10 Apr 2022 00:49:11 +0800</pubDate><description><![CDATA[// 递推, 每个数除了第一个,都可形成长度为2的序列
// 如果差值和之前相同, 那么序列加一, 否则长度为2
// 倒着找最长的, 每段长度L的序列数为(L - 2) * (L - 1) / 2

class Solution {
public:
    int numberOfArithmeticSlices(vector&lt;int&gt;&amp; nums) {
        int n = nums.size();
        vector&lt;int&gt; dp(n);
   .]]></description><category></category></item></channel></rss>