<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[xyhaaab的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/xyhaaab</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; xyhaaab]]></copyright><item><title><![CDATA[wandb: Network error (SSLError), entering retry loop]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/150355076</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/150355076</guid><author>xyhaaab</author><pubDate>Wed, 13 Aug 2025 20:30:52 +0800</pubDate><description><![CDATA[2.如果依然无法解决，可以设置为离线模式，暂时绕过报错。其中，7890替换为自己的端口号。]]></description><category></category></item><item><title><![CDATA[3D目标检测方法TED复现：Transformation-Equivariant 3D Object Detection for Autonomous Driving]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/147197266</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/147197266</guid><author>xyhaaab</author><pubDate>Mon, 21 Apr 2025 18:48:44 +0800</pubDate><description><![CDATA[写在前面：原项目在V100和3090上测试，但是推荐的cuda11.1不支持4090。接下来就和github上的README一样啦！]]></description><category></category></item><item><title><![CDATA[[LeetCode]139.单词拆分（C++）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141648449</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141648449</guid><author>xyhaaab</author><pubDate>Wed, 28 Aug 2024 20:03:08 +0800</pubDate><description><![CDATA[用了动态规划，用一个count1数组记录字符串的前i个字母是否能拆分成单词，状态转移方程是count1[i] = count1[j] &&hashTable.count(s.substr(j,i-j))>0。]]></description><category></category></item><item><title><![CDATA[[LeetCode]416.分割等和子集（C++）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141646888</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141646888</guid><author>xyhaaab</author><pubDate>Wed, 28 Aug 2024 19:58:14 +0800</pubDate><description><![CDATA[如果数组长度小于2或存在一个大于总和一半的数或总和是奇数，那么就不存在等和子集。否则，构造一个矩阵记录前i个数中是否存在总和为j的子集。用了动态规划，如果result[i][j]为true，那么result[i-1][j]为true,或者result[i-1][j-nums[i]]为true。]]></description><category></category></item><item><title><![CDATA[[LeetCode]199.二叉树的右视图（python）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141604608</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141604608</guid><author>xyhaaab</author><pubDate>Tue, 27 Aug 2024 15:44:55 +0800</pubDate><description><![CDATA[，然后用result1记录每一层的最后一个数字。首先用result记录层次遍历的结果（见。]]></description><category></category></item><item><title><![CDATA[[LeetCode]98.验证二叉搜索树（python）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141603503</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141603503</guid><author>xyhaaab</author><pubDate>Tue, 27 Aug 2024 15:13:15 +0800</pubDate><description><![CDATA[在isValidBST内部定义了递归函数isValid，如果结点为空，则返回True，否则检查结点的值是否在规定的范围内，并递归地检查左子树和右子树。]]></description><category></category></item><item><title><![CDATA[[LeetCode]46.全排列（python）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141528158</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141528158</guid><author>xyhaaab</author><pubDate>Sun, 25 Aug 2024 13:04:36 +0800</pubDate><description><![CDATA[定义了一个fill函数，填写从下标n开始的部分，如果n==length，则该该排列符合要求，保存到result中。否则依次交换当前位置的元素与后续元素，递归地生成排列。交换操作后的恢复避免了修改数组造成的错误。]]></description><category></category></item><item><title><![CDATA[[LeetCode]102.二叉树的层序遍历（python）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141527691</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141527691</guid><author>xyhaaab</author><pubDate>Sun, 25 Aug 2024 12:13:00 +0800</pubDate><description><![CDATA[用一个队列控制遍历，一开始队列中只有root，每一次通过检查队列的长度，控制出队的元素个数恰好为一层的个数。每次一个元素出队，依次将它的左右子节点入队，并计入result中对应数组。]]></description><category></category></item><item><title><![CDATA[[LeetCode]438.找到字符串中所有字母异位词（C++）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141431732</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141431732</guid><author>xyhaaab</author><pubDate>Thu, 22 Aug 2024 16:34:45 +0800</pubDate><description><![CDATA[在s中构造一个长度与p相同的滑动窗口，用两个数组分别记录p和滑动窗口中的字母种类和数量，若两个数组完全相同，则表示找到一个字母异位词，将此时滑动窗口的起始位置加入result。]]></description><category></category></item><item><title><![CDATA[[LeetCode]240.搜索二维矩阵II(C++)]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141431600</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141431600</guid><author>xyhaaab</author><pubDate>Thu, 22 Aug 2024 16:29:37 +0800</pubDate><description><![CDATA[对于每一行进行二分查找，如果找到target则返回true，如果最后仍未找到则返回false。]]></description><category></category></item><item><title><![CDATA[[LeetCode]48.旋转图像（python）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141359557</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141359557</guid><author>xyhaaab</author><pubDate>Tue, 20 Aug 2024 15:26:12 +0800</pubDate><description><![CDATA[为了实现原地旋转，每一次覆盖某个位置的值之前要记录其原有值。要实现对整个矩阵的翻转，只要对i in range(n//2)和j in range((n+1)//2)的部分操作，使其对应的4块区域均旋转到所需的位置。]]></description><category></category></item><item><title><![CDATA[[LeetCode]189.轮转数组（python）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141334881</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141334881</guid><author>xyhaaab</author><pubDate>Mon, 19 Aug 2024 21:03:59 +0800</pubDate><description><![CDATA[定义了一个翻转数组的函数reverse。只要把整个数组翻转一次，再把前k个元素翻转一次，把第k+1个元素到末尾部分翻转依次，即得到轮转后的数组。]]></description><category></category></item><item><title><![CDATA[[LeetCode]54.螺旋矩阵（C++）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141315508</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141315508</guid><author>xyhaaab</author><pubDate>Mon, 19 Aug 2024 10:20:35 +0800</pubDate><description><![CDATA[定义了matrix2记矩阵中的元素是否已经被访问，定义了i，j记录当前访问位置，定义了direction记录螺旋运动的方向，每一次移动后检查下一次移动是否会越界或重复访问并据此调整方向，当数组中元素个数与矩阵中元素个数相同时访问结束。]]></description><category></category></item><item><title><![CDATA[[LeetCode]53.最大子数组和（C++）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141311477</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141311477</guid><author>xyhaaab</author><pubDate>Mon, 19 Aug 2024 09:37:21 +0800</pubDate><description><![CDATA[用了动态规划，current_sum记录了以当前位置为末尾的最大子数组和，max_sum记录了当前的最大子数组和。]]></description><category></category></item><item><title><![CDATA[[LeetCode]160.相交链表(python)]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141300079</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141300079</guid><author>xyhaaab</author><pubDate>Sun, 18 Aug 2024 15:05:30 +0800</pubDate><description><![CDATA[开始，指针在到达链表末尾时切换到另一个链表的头节点。这样，两指针将会在相交节点处相遇，或者都到达。如果存在交点，最终这两个指针会相遇在交点；如果没有交点，则指针同时变为。通过使用两个指针遍历两个链表，分别从。]]></description><category></category></item><item><title><![CDATA[[LeetCode]148.排序链表（python）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141298883</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141298883</guid><author>xyhaaab</author><pubDate>Sun, 18 Aug 2024 14:00:34 +0800</pubDate><description><![CDATA[将链表以中点为界分为左右两个链表，分别对左右两个链表按升序排序后再合并这两个有序链表。在找链表的中点用时了快慢指针，每一个循环快指针走两步，慢指针走一步，当快指针到达末尾或末尾前一个位置时，慢指针到达中点。]]></description><category></category></item><item><title><![CDATA[[LeetCode]200.岛屿数量（C++)]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141272264</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141272264</guid><author>xyhaaab</author><pubDate>Sat, 17 Aug 2024 07:45:00 +0800</pubDate><description><![CDATA[扫描整个网格，每次遇到为1的位置，则以它为起始结点深度优先搜索，将所有被搜索到的1改为0，并将岛屿数+1。定义深度搜索函数时，如果被搜到的位置为0或越界则直接返回，否则将对应位置标为0，并且依次以相邻的4个位置为起始结点深度搜索。]]></description><category></category></item><item><title><![CDATA[[LeetCode]21.合并两个有序链表（C++）]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141272413</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141272413</guid><author>xyhaaab</author><pubDate>Sat, 17 Aug 2024 00:27:09 +0800</pubDate><description><![CDATA[用了递归的想法，每次选取两个链表头较小的元素作为所求链表的第一个值，所求链表的剩余部分为两个链表剩余部分合并的结果。]]></description><category></category></item><item><title><![CDATA[[LeetCode]279.完全平方数(python)]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141254008</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141254008</guid><author>xyhaaab</author><pubDate>Fri, 16 Aug 2024 11:02:10 +0800</pubDate><description><![CDATA[运用动态规划，维护一个result数组，对于每一个数值，遍历它包含1到sqrt(n)平方项的情况。]]></description><category></category></item><item><title><![CDATA[[LeetCode]322.零钱兑换(python)]]></title><link>https://blog.youkuaiyun.com/xyhaaab/article/details/141253565</link><guid>https://blog.youkuaiyun.com/xyhaaab/article/details/141253565</guid><author>xyhaaab</author><pubDate>Fri, 16 Aug 2024 10:53:44 +0800</pubDate><description><![CDATA[使用动态规划，维护一个result数组来记录每个金额所需的最少硬币数，对于每个金额，遍历最后一个硬币是coins中所有值的情况，如果最终硬币数仍为初始的max_amount则无法凑成返回-1，否则返回最小金额数。]]></description><category></category></item></channel></rss>