<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[weixin_43831008的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/weixin_43831008</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; weixin_43831008]]></copyright><item><title><![CDATA[【知识合集】一些比较好的帖子（Diffusion、Transformer等）]]></title><link>https://blog.youkuaiyun.com/weixin_43831008/article/details/143486117</link><guid>https://blog.youkuaiyun.com/weixin_43831008/article/details/143486117</guid><author>weixin_43831008</author><pubDate>Mon, 04 Nov 2024 15:38:01 +0800</pubDate><description><![CDATA[transformer系列
https://blog.youkuaiyun.com/qq_41816368/article/details/134537875


]]></description><category></category></item><item><title><![CDATA[【Debug合集】常用环境问题整理]]></title><link>https://blog.youkuaiyun.com/weixin_43831008/article/details/143478551</link><guid>https://blog.youkuaiyun.com/weixin_43831008/article/details/143478551</guid><author>weixin_43831008</author><pubDate>Mon, 04 Nov 2024 10:49:30 +0800</pubDate><description><![CDATA[【代码】【Debug合集】常用环境问题整理。]]></description><category></category></item><item><title><![CDATA[【LeetCode刷题日记01】101.对称二叉树]]></title><link>https://blog.youkuaiyun.com/weixin_43831008/article/details/142033917</link><guid>https://blog.youkuaiyun.com/weixin_43831008/article/details/142033917</guid><author>weixin_43831008</author><pubDate>Sun, 08 Sep 2024 22:02:47 +0800</pubDate><description><![CDATA[这里经验不足，因为之前思维惯性，不需要讨论，只需root满足一个条件后return；这题最大的收获是：当写不出来的时候不要盯着遍历的模板，而是需要灵活变通。当left == right == null时，说明父节点（调用节点）是叶子节点，叶子节点显然满足定义，孩子都是null，是对称的。否则，继续向下调用，查看left的左孩子和right的右孩子、left的右孩子和right的左孩子是否都能满足定义。这里采用两个，left与right，分别指代父节点的两个孩子；left和right都不为空时，分类讨论。]]></description><category></category></item></channel></rss>