<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Junmo12345的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Junmo12345</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Junmo12345]]></copyright><item><title><![CDATA[【LeetCode面试150】——21合并两个有序列表]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/145159183</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/145159183</guid><author>Junmo12345</author><pubDate>Wed, 15 Jan 2025 14:06:56 +0800</pubDate><description><![CDATA[【LeetCode面试150】——21合并两个有序列表题目分析和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——2两数相加]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/145139999</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/145139999</guid><author>Junmo12345</author><pubDate>Tue, 14 Jan 2025 15:15:38 +0800</pubDate><description><![CDATA[【LeetCode面试150】——2两数相加题目解析以及代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——141环形列表]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/144146684</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/144146684</guid><author>Junmo12345</author><pubDate>Fri, 29 Nov 2024 22:04:46 +0800</pubDate><description><![CDATA[【LeetCode面试150】——141环形列表解题思路讲解和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——20有效的括号]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/144142809</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/144142809</guid><author>Junmo12345</author><pubDate>Fri, 29 Nov 2024 17:52:52 +0800</pubDate><description><![CDATA[【LeetCode面试150】——20有效的括号解题思路分析以及代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——452用最少数量的箭引爆气球]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/144115543</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/144115543</guid><author>Junmo12345</author><pubDate>Thu, 28 Nov 2024 16:56:13 +0800</pubDate><description><![CDATA[【LeetCode面试150】——452用最少数量的箭引爆气球题目思路分析和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——57插入区间]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/144084652</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/144084652</guid><author>Junmo12345</author><pubDate>Wed, 27 Nov 2024 15:00:54 +0800</pubDate><description><![CDATA[【LeetCode面试150】——57插入区间题目分析和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——56合并区间]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/144053874</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/144053874</guid><author>Junmo12345</author><pubDate>Tue, 26 Nov 2024 11:17:17 +0800</pubDate><description><![CDATA[【LeetCode面试150】——56合并区间题目分析和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——228汇总区间]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/144040707</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/144040707</guid><author>Junmo12345</author><pubDate>Mon, 25 Nov 2024 21:00:13 +0800</pubDate><description><![CDATA[【LeetCode面试150】——228汇总区间题目分析和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——128最长连续序列]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/144026670</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/144026670</guid><author>Junmo12345</author><pubDate>Mon, 25 Nov 2024 14:26:51 +0800</pubDate><description><![CDATA[【LeetCode面试150】——128最长连续序列题目分析和代码实现]]></description><category></category></item><item><title><![CDATA[【LLM】一文学会SPPO]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/144000383</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/144000383</guid><author>Junmo12345</author><pubDate>Sat, 23 Nov 2024 22:39:21 +0800</pubDate><description><![CDATA[SPPO是强化学习的一种，据猜测今年9月OpenAI最新的大模型O1使用该方法进行微调。SPPO英文全称Self-Play Preference Optimization，中文为自博弈偏好优化。其受到了纳什均衡的冯·诺依曼两人常和博弈公式以及RLHF+PPO框架的启发，而设计出来。下面本文将讲解SPPO的损失函数、策略梯度更新以及算法框架。]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——219存在重复元素]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/143995533</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/143995533</guid><author>Junmo12345</author><pubDate>Sat, 23 Nov 2024 17:28:35 +0800</pubDate><description><![CDATA[【LeetCode面试150】——219存在重复元素题目分析和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——202快乐数]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/143944366</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/143944366</guid><author>Junmo12345</author><pubDate>Thu, 21 Nov 2024 14:17:23 +0800</pubDate><description><![CDATA[【LeetCode面试150】——202快乐数题目分析和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——1两数之和]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/143912357</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/143912357</guid><author>Junmo12345</author><pubDate>Wed, 20 Nov 2024 14:52:54 +0800</pubDate><description><![CDATA[【LeetCode面试150】——1两数之和题目分析以及代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——49字母异位分词]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/143881991</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/143881991</guid><author>Junmo12345</author><pubDate>Tue, 19 Nov 2024 13:10:52 +0800</pubDate><description><![CDATA[【LeetCode面试150】——49字母异位分词题目分析以及代码实现]]></description><category></category></item><item><title><![CDATA[【LLM】一文学懂DPO]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/143871285</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/143871285</guid><author>Junmo12345</author><pubDate>Tue, 19 Nov 2024 08:05:49 +0800</pubDate><description><![CDATA[一文学懂直接偏好优化DPO]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——242有效的字母异位]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/143863170</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/143863170</guid><author>Junmo12345</author><pubDate>Mon, 18 Nov 2024 17:53:44 +0800</pubDate><description><![CDATA[【LeetCode面试150】——242有效的字母异位题目分析以及代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——209单词规律]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/142487581</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/142487581</guid><author>Junmo12345</author><pubDate>Tue, 24 Sep 2024 13:41:24 +0800</pubDate><description><![CDATA[【LeetCode面试150】——209单词规律题目讲解与代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——205同构字符串]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/141952496</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/141952496</guid><author>Junmo12345</author><pubDate>Fri, 06 Sep 2024 10:16:42 +0800</pubDate><description><![CDATA[【LeetCode面试150】——205同构字符串题目讲解和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——73矩阵置零]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/141701612</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/141701612</guid><author>Junmo12345</author><pubDate>Fri, 30 Aug 2024 08:49:53 +0800</pubDate><description><![CDATA[【LeetCode面试150】——73矩阵置零题目讲解和代码实现]]></description><category></category></item><item><title><![CDATA[【LeetCode面试150】——48旋转图像]]></title><link>https://blog.youkuaiyun.com/Junmo12345/article/details/141671152</link><guid>https://blog.youkuaiyun.com/Junmo12345/article/details/141671152</guid><author>Junmo12345</author><pubDate>Thu, 29 Aug 2024 10:04:36 +0800</pubDate><description><![CDATA[【LeetCode面试150】——48旋转图像题目解析和代码实现]]></description><category></category></item></channel></rss>