<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Conner7的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Conner7</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Conner7]]></copyright><item><title><![CDATA[【知识】正反例分析面向对象的七大设计原则（超详细）]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/143200083</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/143200083</guid><author>Conner7</author><pubDate>Thu, 24 Oct 2024 11:07:28 +0800</pubDate><description><![CDATA[学习面向对象的设计原则有助于提升代码的可维护性、可扩展性和可复用性。这些原则帮助开发者在设计系统时减少类与类之间的耦合、增强模块的独立性，使代码更容易适应需求变化，同时降低了修改时引入错误的风险。通过遵循这些设计原则，开发者能够编写更清晰、灵活、稳定的代码，有效应对复杂的业务场景和长期的软件维护。]]></description><category></category></item><item><title><![CDATA[【调研】弱网环境下分片上传方案调研]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/141609513</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/141609513</guid><author>Conner7</author><pubDate>Tue, 27 Aug 2024 18:18:28 +0800</pubDate><description><![CDATA[对主流的一些分片上传方案进行了一些调研。]]></description><category></category></item><item><title><![CDATA[【项目】运行iOS项目的一般流程]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/141466761</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/141466761</guid><author>Conner7</author><pubDate>Tue, 27 Aug 2024 14:27:56 +0800</pubDate><description><![CDATA[记录一些运行iOS项目的基本流程和通用问题]]></description><category></category></item><item><title><![CDATA[【知识】吐血总结Objective-C中的内存管理 纯原创（含循环引用问题图解）]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/141434131</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/141434131</guid><author>Conner7</author><pubDate>Fri, 23 Aug 2024 15:32:30 +0800</pubDate><description><![CDATA[讲解了Objective-C的内存管理方式和常见的内存管理问题。]]></description><category></category></item><item><title><![CDATA[【调研】有关客户端中文件上传并行数量、分片大小对传输速率的影响以及选取依据]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/141029002</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/141029002</guid><author>Conner7</author><pubDate>Thu, 22 Aug 2024 17:31:41 +0800</pubDate><description><![CDATA[当文件体积较大、网络环境不稳定或需要提高上传效率时，文件上传需要使用分片上传。分片上传可以将大文件分割成多个小块，逐一上传，从而避免单次上传过大的数据导致失败。此外，如果网络中断或上传失败，只需重新上传失败的部分，而不是整个文件，这样可以节省时间和带宽。分片上传还支持并行处理，提高了上传速度和效率。因此，在处理大文件和不稳定网络环境时，分片上传是一种更可靠和高效的解决方案。而在分片上传中，并行路数和分片大小的选值对上传的速率和成功率相当重要。]]></description><category></category></item><item><title><![CDATA[【算法】一文带你搞懂完全背包！（附背包问题总结）]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/140997854</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/140997854</guid><author>Conner7</author><pubDate>Thu, 22 Aug 2024 17:31:20 +0800</pubDate><description><![CDATA[详解动态规划中的完全背包问题原理及应用，了解多重背包，以及总结笔试面试中解决背包问题的关键。]]></description><category></category></item><item><title><![CDATA[【算法】一文带你搞懂0-1背包问题！（实战篇）]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/140826476</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/140826476</guid><author>Conner7</author><pubDate>Wed, 31 Jul 2024 22:21:12 +0800</pubDate><description><![CDATA[详解动态规划中的0-1背包问题原理及应用]]></description><category></category></item><item><title><![CDATA[【算法】一文带你搞懂0-1背包问题！（理论篇）]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/140823231</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/140823231</guid><author>Conner7</author><pubDate>Wed, 31 Jul 2024 20:45:00 +0800</pubDate><description><![CDATA[详解动态规划中的0-1背包问题原理及应用]]></description><category></category></item><item><title><![CDATA[【算法】从前序与中序遍历序列构建二叉树]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/138371155</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/138371155</guid><author>Conner7</author><pubDate>Wed, 01 May 2024 15:12:07 +0800</pubDate><description><![CDATA[与二叉树的遍历相反，能不能通过二叉树的遍历结果确定一棵二叉树，怎样确定？今年做到过的一道笔试题便是以此题为基础，故记录分享于此。]]></description><category></category></item><item><title><![CDATA[【算法】C++经典算法题——接雨水！]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/138356882</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/138356882</guid><author>Conner7</author><pubDate>Tue, 30 Apr 2024 21:38:20 +0800</pubDate><description><![CDATA[使用单调栈算法，接明白雨水！]]></description><category></category></item><item><title><![CDATA[【算法】代码随想录刷题记录 | 动态规划篇（一）]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/136707671</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/136707671</guid><author>Conner7</author><pubDate>Mon, 01 Apr 2024 16:53:48 +0800</pubDate><description><![CDATA[刷代码随想录LeetCode题的一些记录和感想（动态规划篇（一））]]></description><category></category></item><item><title><![CDATA[【算法】代码随想录刷题记录 | 6. 二叉树篇（上）]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/135676132</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/135676132</guid><author>Conner7</author><pubDate>Wed, 13 Mar 2024 19:00:39 +0800</pubDate><description><![CDATA[刷代码随想录LeetCode题的一些记录和感想（二叉树篇（上））]]></description><category></category></item><item><title><![CDATA[【算法】LRU缓存算法的C++实现]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/136572016</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/136572016</guid><author>Conner7</author><pubDate>Sat, 09 Mar 2024 16:10:44 +0800</pubDate><description><![CDATA[LRU缓存算法是一种淘汰算法，也是一道经典的面试题，本文对LRU缓存算法的C++实现做了讲解。]]></description><category></category></item><item><title><![CDATA[【算法】C++快速排序算法]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/136570232</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/136570232</guid><author>Conner7</author><pubDate>Fri, 08 Mar 2024 20:22:20 +0800</pubDate><description><![CDATA[快速排序是主流的排序算法之一，作为一种交换排序算法，快排通过分治法使平均时间复杂度达到了O(nlogn)。本文主要讲解了快速排序算法的C++实现（含完整代码）。]]></description><category></category></item><item><title><![CDATA[【算法】代码随想录刷题记录 | 5. 栈与队列篇]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/135611490</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/135611490</guid><author>Conner7</author><pubDate>Wed, 17 Jan 2024 16:59:04 +0800</pubDate><description><![CDATA[刷代码随想录LeetCode题的一些记录和感想（栈与队列篇）]]></description><category></category></item><item><title><![CDATA[【算法】代码随想录刷题记录 | 4. 字符串篇（含KMP算法详细步骤及代码）]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/135534712</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/135534712</guid><author>Conner7</author><pubDate>Thu, 11 Jan 2024 20:29:48 +0800</pubDate><description><![CDATA[刷代码随想录LeetCode题的一些记录和感想（字符串篇）]]></description><category></category></item><item><title><![CDATA[【算法】代码随想录刷题记录 | 3. 哈希表篇]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/135485216</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/135485216</guid><author>Conner7</author><pubDate>Wed, 10 Jan 2024 20:01:14 +0800</pubDate><description><![CDATA[刷代码随想录LeetCode题的一些记录和感想（哈希表篇）]]></description><category></category></item><item><title><![CDATA[【算法】代码随想录刷题记录 | 2. 链表篇]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/135283807</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/135283807</guid><author>Conner7</author><pubDate>Mon, 08 Jan 2024 18:46:34 +0800</pubDate><description><![CDATA[刷代码随想录LeetCode题的一些记录和感想（链表篇）]]></description><category></category></item><item><title><![CDATA[【算法】代码随想录刷题记录 | 1. 数组篇]]></title><link>https://blog.youkuaiyun.com/Conner7/article/details/135258518</link><guid>https://blog.youkuaiyun.com/Conner7/article/details/135258518</guid><author>Conner7</author><pubDate>Thu, 28 Dec 2023 00:45:11 +0800</pubDate><description><![CDATA[刷代码随想录LeetCode题的一些记录和感想（数组篇）]]></description><category></category></item></channel></rss>