<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ccd9287的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ccd9287</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ccd9287]]></copyright><item><title><![CDATA[_pickle.UnpicklingError: Weights only load failed. 解决方法]]></title><link>https://blog.youkuaiyun.com/ccd9287/article/details/146259219</link><guid>https://blog.youkuaiyun.com/ccd9287/article/details/146259219</guid><author>ccd9287</author><pubDate>Fri, 14 Mar 2025 17:21:51 +0800</pubDate><description><![CDATA[懒得翻译了，方案一是有效的，方案二没试。]]></description><category></category></item><item><title><![CDATA[C++面试八股文记录]]></title><link>https://blog.youkuaiyun.com/ccd9287/article/details/143806829</link><guid>https://blog.youkuaiyun.com/ccd9287/article/details/143806829</guid><author>ccd9287</author><pubDate>Sat, 16 Nov 2024 22:20:44 +0800</pubDate><description><![CDATA[C++面试题 个人学习记录]]></description><category></category></item><item><title><![CDATA[力扣380 记录]]></title><link>https://blog.youkuaiyun.com/ccd9287/article/details/142961085</link><guid>https://blog.youkuaiyun.com/ccd9287/article/details/142961085</guid><author>ccd9287</author><pubDate>Tue, 15 Oct 2024 18:14:06 +0800</pubDate><description><![CDATA[还记得dict字典就是哈希表，list列表就是变长数组，其实这道题目是考察常用数据结构的真正原理。]]></description><category></category></item><item><title><![CDATA[力扣 2617 网格图中最少访问的格子数]]></title><link>https://blog.youkuaiyun.com/ccd9287/article/details/142303839</link><guid>https://blog.youkuaiyun.com/ccd9287/article/details/142303839</guid><author>ccd9287</author><pubDate>Tue, 17 Sep 2024 03:18:34 +0800</pubDate><description><![CDATA[要求从左上角移动到右下角，允许的移动方式只有两种，右移和下移，移动的距离是当前格子中的数字，所以是类似于跳棋，就是要跳着走。]]></description><category></category></item><item><title><![CDATA[【力扣-6】Z字形变换 python解题思路]]></title><link>https://blog.youkuaiyun.com/ccd9287/article/details/142286286</link><guid>https://blog.youkuaiyun.com/ccd9287/article/details/142286286</guid><author>ccd9287</author><pubDate>Sun, 15 Sep 2024 17:45:36 +0800</pubDate><description><![CDATA[【力扣-6】Z字形变换 python解题思路。]]></description><category></category></item><item><title><![CDATA[【力扣-3】无重复字符的最长子串 python解题思路]]></title><link>https://blog.youkuaiyun.com/ccd9287/article/details/142266514</link><guid>https://blog.youkuaiyun.com/ccd9287/article/details/142266514</guid><author>ccd9287</author><pubDate>Sat, 14 Sep 2024 21:51:27 +0800</pubDate><description><![CDATA[【力扣-3】无重复字符的最长子串 python解题思路。]]></description><category></category></item><item><title><![CDATA[【力扣-112 113】二叉树 python解题思路]]></title><link>https://blog.youkuaiyun.com/ccd9287/article/details/142170876</link><guid>https://blog.youkuaiyun.com/ccd9287/article/details/142170876</guid><author>ccd9287</author><pubDate>Thu, 12 Sep 2024 16:06:22 +0800</pubDate><description><![CDATA[【力扣-112 113】二叉树 python解题思路。]]></description><category></category></item><item><title><![CDATA[【力扣-37】递归与回溯 python解题思路]]></title><link>https://blog.youkuaiyun.com/ccd9287/article/details/142147271</link><guid>https://blog.youkuaiyun.com/ccd9287/article/details/142147271</guid><author>ccd9287</author><pubDate>Wed, 11 Sep 2024 18:58:14 +0800</pubDate><description><![CDATA[本文代码使用回溯，用于记录个人编写回溯的思路代码思路看注释即可。]]></description><category></category></item><item><title><![CDATA[【力扣-36】哈希表 python解题思路]]></title><link>https://blog.youkuaiyun.com/ccd9287/article/details/142103488</link><guid>https://blog.youkuaiyun.com/ccd9287/article/details/142103488</guid><author>ccd9287</author><pubDate>Wed, 11 Sep 2024 17:37:49 +0800</pubDate><description><![CDATA[之前面试时被问到python中dict的实现原理以及哈希表的原理没有回答上来，学习之后做以下记录。通过hash函数表达式可以使用关键字（key）来获取索引（index），相当于为地址打上了一个tag，对应上dict就是key定位value。其次，哈希表作为表格，取连号的index作为表头，所有哈希表表长有限，哈希函数需要让key经过转换后都落在表中且尽可能不存在冲突和减少空闲格。然后，哈希函数的生成应该由key开始分析，然后得到连号索引。]]></description><category></category></item></channel></rss>