<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[bkhyv的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/bkhyv</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bkhyv]]></copyright><item><title><![CDATA[ThreadSafeSharedPtr]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131784883</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131784883</guid><author>bkhyv</author><pubDate>Tue, 18 Jul 2023 12:58:28 +0800</pubDate><description><![CDATA[【代码】线程安全的shared_ptr。]]></description><category></category></item><item><title><![CDATA[347. 前 K 个高频元素]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131524827</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131524827</guid><author>bkhyv</author><pubDate>Mon, 03 Jul 2023 22:22:42 +0800</pubDate><description><![CDATA[347. 前 K 个高频元素]]></description><category></category></item><item><title><![CDATA[docker挂载机械硬盘]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131519316</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131519316</guid><author>bkhyv</author><pubDate>Mon, 03 Jul 2023 16:54:49 +0800</pubDate><description><![CDATA[drive --rm --volumn /sda1:/sda1:ro  —>>>read only
drive --rm --volumn /sda1:/sda1:rw —>>>read write]]></description><category></category></item><item><title><![CDATA[10. 正则表达式匹配]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131501827</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131501827</guid><author>bkhyv</author><pubDate>Sun, 02 Jul 2023 15:58:57 +0800</pubDate><description><![CDATA[10. 正则表达式匹配]]></description><category></category></item><item><title><![CDATA[560. 和为 K 的子数组]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131500453</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131500453</guid><author>bkhyv</author><pubDate>Sun, 02 Jul 2023 14:02:56 +0800</pubDate><description><![CDATA[560. 和为 K 的子数组]]></description><category></category></item><item><title><![CDATA[4. 寻找两个正序数组的中位数]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131405558</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131405558</guid><author>bkhyv</author><pubDate>Mon, 26 Jun 2023 21:08:59 +0800</pubDate><description><![CDATA[4. 寻找两个正序数组的中位数]]></description><category></category></item><item><title><![CDATA[76. 最小覆盖子串]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131366656</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131366656</guid><author>bkhyv</author><pubDate>Sat, 24 Jun 2023 21:22:33 +0800</pubDate><description><![CDATA[76. 最小覆盖子串]]></description><category></category></item><item><title><![CDATA[3. 无重复字符的最长子串]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131364484</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131364484</guid><author>bkhyv</author><pubDate>Sat, 24 Jun 2023 17:58:58 +0800</pubDate><description><![CDATA[3. 无重复字符的最长子串]]></description><category></category></item><item><title><![CDATA[what(): Pangolin X11: Failed to open X display]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131103137</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131103137</guid><author>bkhyv</author><pubDate>Thu, 08 Jun 2023 10:46:26 +0800</pubDate><description><![CDATA[【代码】what(): Pangolin X11: Failed to open X display。]]></description><category></category></item><item><title><![CDATA[718. 最长重复子数组 && 1143. 最长公共子序列 && 115. 不同的子序列]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/131023815</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/131023815</guid><author>bkhyv</author><pubDate>Sat, 03 Jun 2023 17:46:53 +0800</pubDate><description><![CDATA[【代码】718. 最长重复子数组 && 1143. 最长公共子序列。]]></description><category></category></item><item><title><![CDATA[ORB-SLAM3和Vins-Mono初始化差异]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/130651565</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/130651565</guid><author>bkhyv</author><pubDate>Fri, 12 May 2023 22:55:13 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[稀疏矩阵乘法]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/130610855</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/130610855</guid><author>bkhyv</author><pubDate>Wed, 10 May 2023 21:57:54 +0800</pubDate><description><![CDATA[【代码】稀疏矩阵乘法。]]></description><category></category></item><item><title><![CDATA[C++ sort函数的使用注意事项及潜在bug]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/130463153</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/130463153</guid><author>bkhyv</author><pubDate>Tue, 02 May 2023 14:06:01 +0800</pubDate><description><![CDATA[严格弱序的定义：如果两个元素具备任何一个元素都不小于另一个元素的性质，那么就视为它们是具备某种程度之等价关系是合理的。(x<y) &&!(y<x) , 广义上!op(x,y) &&!op(y,x)  （op(x,y) 表示比较x和y）而不能是 <= 或者 >= ，（实际上等于号加了也是毫无意义，sort是不稳定的排序），否则可能会出现段错误。sort函数的cmp必须按照规定来写，即必须只是 > 或者 <比如: return a > b;《c++标准程序库》 P176。《泛型编程与STL》第六章。]]></description><category></category></item><item><title><![CDATA[子集1&2 排列1&2 coding]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/130447941</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/130447941</guid><author>bkhyv</author><pubDate>Sun, 30 Apr 2023 13:47:04 +0800</pubDate><description><![CDATA[给你一个整数数组 nums ，数组中的元素 互不相同。返回该数组所有可能的子集（幂集）。解集 不能 包含重复的子集。你可以按 任意顺序 返回解集。int。]]></description><category></category></item><item><title><![CDATA[数组中的第K个最大元素（3种解法）]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/130089812</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/130089812</guid><author>bkhyv</author><pubDate>Tue, 11 Apr 2023 17:55:11 +0800</pubDate><description><![CDATA[数组中的第K个最大元素（3种解法）]]></description><category></category></item><item><title><![CDATA[单应矩阵深入分析]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/129946292</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/129946292</guid><author>bkhyv</author><pubDate>Tue, 04 Apr 2023 10:20:04 +0800</pubDate><description><![CDATA[单应矩阵深入分析]]></description><category></category></item><item><title><![CDATA[中序遍历（迭代法）]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/129846803</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/129846803</guid><author>bkhyv</author><pubDate>Wed, 29 Mar 2023 22:17:01 +0800</pubDate><description><![CDATA[中序遍历（迭代法）]]></description><category></category></item><item><title><![CDATA[递归的时间复杂度和空间复杂度]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/129102650</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/129102650</guid><author>bkhyv</author><pubDate>Sat, 18 Feb 2023 17:41:07 +0800</pubDate><description><![CDATA[递归算法复杂度]]></description><category></category></item><item><title><![CDATA[docker]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/128887483</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/128887483</guid><author>bkhyv</author><pubDate>Sun, 05 Feb 2023 00:27:59 +0800</pubDate><description><![CDATA[docker]]></description><category></category></item><item><title><![CDATA[scan contex]]></title><link>https://blog.youkuaiyun.com/bkhyv/article/details/127867949</link><guid>https://blog.youkuaiyun.com/bkhyv/article/details/127867949</guid><author>bkhyv</author><pubDate>Tue, 15 Nov 2022 16:10:17 +0800</pubDate><description><![CDATA[scan contex]]></description><category></category></item></channel></rss>