<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Graceying的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Graceying</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Graceying]]></copyright><item><title><![CDATA[如何在 KDE Plasma桌面进行屏幕共享]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/135913231</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/135913231</guid><author>Graceying</author><pubDate>Mon, 29 Jan 2024 15:19:59 +0800</pubDate><description><![CDATA[如何在 KDE Plasma 桌面进行屏幕共享]]></description><category></category></item><item><title><![CDATA[libsvm学习资料]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/135534868</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/135534868</guid><author>Graceying</author><pubDate>Thu, 11 Jan 2024 17:21:23 +0800</pubDate><description><![CDATA[SVM模型进行分类预测时的参数调整技巧]]></description><category></category></item><item><title><![CDATA[Opencv图像处理系列（九）—— 图像轮廓]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/130800192</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/130800192</guid><author>Graceying</author><pubDate>Mon, 22 May 2023 09:14:35 +0800</pubDate><description><![CDATA[Opencv图像处理系列（九）—— 图像轮廓]]></description><category></category></item><item><title><![CDATA[全网最细的CMake教程！(强烈建议收藏)]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/130084202</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/130084202</guid><author>Graceying</author><pubDate>Tue, 11 Apr 2023 15:02:28 +0800</pubDate><description><![CDATA[全网最细的CMake教程！(强烈建议收藏)]]></description><category></category></item><item><title><![CDATA[python 用 matplotlib 的 matshow() 函数绘制矩阵]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/127670252</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/127670252</guid><author>Graceying</author><pubDate>Thu, 03 Nov 2022 14:49:16 +0800</pubDate><description><![CDATA[matshow]]></description><category></category></item><item><title><![CDATA[ubuntu18.04安装微信]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/127321020</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/127321020</guid><author>Graceying</author><pubDate>Fri, 14 Oct 2022 15:12:51 +0800</pubDate><description><![CDATA[ubuntu18.04安装微信]]></description><category></category></item><item><title><![CDATA[Ubuntu安装opencv4(c++)遇到的问题及解决方法]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/126993279</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/126993279</guid><author>Graceying</author><pubDate>Thu, 22 Sep 2022 16:39:37 +0800</pubDate><description><![CDATA[Ubuntu安装opencv4(c++)遇到的问题及解决方法]]></description><category></category></item><item><title><![CDATA[[leetcode]剑指 Offer 30. 包含min函数的栈]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/120902050</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/120902050</guid><author>Graceying</author><pubDate>Wed, 10 Aug 2022 09:52:20 +0800</pubDate><description><![CDATA[[leetcode]剑指 Offer 30. 包含min函数的栈]]></description><category></category></item><item><title><![CDATA[【leetcode-python】链表反转]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/120866236</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/120866236</guid><author>Graceying</author><pubDate>Wed, 10 Aug 2022 09:51:18 +0800</pubDate><description><![CDATA[将链表中值逆序输出为一个列表]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】5. 最长回文子串]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/126074181</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/126074181</guid><author>Graceying</author><pubDate>Sat, 30 Jul 2022 16:36:55 +0800</pubDate><description><![CDATA[给你一个字符串s，找到s中最长的回文子串。]]></description><category></category></item><item><title><![CDATA[kubuntu18.04 重装显卡驱动后无法进入桌面]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125950892</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125950892</guid><author>Graceying</author><pubDate>Sat, 23 Jul 2022 18:15:47 +0800</pubDate><description><![CDATA[kubuntu18.04 重装显卡驱动后无法进入桌面]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】169. 多数元素]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125884071</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125884071</guid><author>Graceying</author><pubDate>Wed, 20 Jul 2022 01:03:34 +0800</pubDate><description><![CDATA[【LeetCode热题HOT100】169.多数元素]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】283. 移动零-python]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125883910</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125883910</guid><author>Graceying</author><pubDate>Wed, 20 Jul 2022 00:50:40 +0800</pubDate><description><![CDATA[【LeetCode 热题 HOT 100】283. 移动零-python]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】121. 买卖股票的最佳时机]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125882995</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125882995</guid><author>Graceying</author><pubDate>Tue, 19 Jul 2022 23:09:48 +0800</pubDate><description><![CDATA[【LeetCode 热题 HOT 100】121. 买卖股票的最佳时机]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】136. 只出现一次的数字]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125882573</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125882573</guid><author>Graceying</author><pubDate>Tue, 19 Jul 2022 22:35:37 +0800</pubDate><description><![CDATA[【LeetCode 热题 HOT 100】136. 只出现一次的数字]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】101. 对称二叉树]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125877664</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125877664</guid><author>Graceying</author><pubDate>Tue, 19 Jul 2022 17:59:55 +0800</pubDate><description><![CDATA[【LeetCode热题HOT100】101.对称二叉树。]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】104.二叉树的最大深度]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125874106</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125874106</guid><author>Graceying</author><pubDate>Tue, 19 Jul 2022 16:06:59 +0800</pubDate><description><![CDATA[【LeetCode热题HOT100】104 二叉树的最大深度。]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】206. 反转链表]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125861801</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125861801</guid><author>Graceying</author><pubDate>Mon, 18 Jul 2022 22:36:50 +0800</pubDate><description><![CDATA[【LeetCode 热题 HOT 100】206. 反转链表]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】3. 无重复字符的最长子串--python实现]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125839193</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125839193</guid><author>Graceying</author><pubDate>Sun, 17 Jul 2022 23:49:25 +0800</pubDate><description><![CDATA[【LeetCode热题HOT100】3.无重复字符的最长子串--python实现。]]></description><category></category></item><item><title><![CDATA[【LeetCode 热题 HOT 100】2. 两数相加--python实现]]></title><link>https://blog.youkuaiyun.com/Graceying/article/details/125830597</link><guid>https://blog.youkuaiyun.com/Graceying/article/details/125830597</guid><author>Graceying</author><pubDate>Sun, 17 Jul 2022 12:37:51 +0800</pubDate><description><![CDATA[【LeetCode热题HOT100】2.两数相加--python实现。]]></description><category></category></item></channel></rss>