<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[J_pluto的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/J_pluto</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; J_pluto]]></copyright><item><title><![CDATA[146. LRU 缓存]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/148064467</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/148064467</guid><author>J_pluto</author><pubDate>Mon, 19 May 2025 15:42:12 +0800</pubDate><description><![CDATA[【代码】146. LRU 缓存。]]></description><category></category></item><item><title><![CDATA[JavaWeb修改部门功能实现【黑马程序员 tlias-web-management】]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144752296</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144752296</guid><author>J_pluto</author><pubDate>Thu, 26 Dec 2024 20:59:13 +0800</pubDate><description><![CDATA[PostMapping：适用于需要创建新资源的场景。@PutMapping：适用于需要更新现有资源的场景。参数格式：application/json。参数格式：application/json。接口描述：该接口用于根据ID查询部门数据。格式：application/json。请求路径：/depts/{id}接口描述：该接口用于修改部门数据。请求路径：/depts。]]></description><category></category></item><item><title><![CDATA[【二叉树】力扣 129.求根节点到叶子节点数字之和]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144492632</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144492632</guid><author>J_pluto</author><pubDate>Sun, 15 Dec 2024 21:14:53 +0800</pubDate><description><![CDATA[每找到一个非空节点，之前路径上的所有节点的数量级都要增加1个单位。例如，当前节点为3，之前的节点路径为1 -> 2，presum = 1 * 10 + 2 = 12，现在路径变为了 1 -> 2 -> 3，sum = presum * 10 + 3。]]></description><category></category></item><item><title><![CDATA[【二叉树】力扣 112.路经总和]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144491367</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144491367</guid><author>J_pluto</author><pubDate>Sun, 15 Dec 2024 20:08:26 +0800</pubDate><description><![CDATA[【代码】【二叉树】力扣 112.路经总和。]]></description><category></category></item><item><title><![CDATA[【链表】力扣 141. 环形链表]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144276694</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144276694</guid><author>J_pluto</author><pubDate>Thu, 05 Dec 2024 21:38:12 +0800</pubDate><description><![CDATA[【代码】【链表】力扣 141. 环形链表。]]></description><category></category></item><item><title><![CDATA[【二分查找】力扣 875. 爱吃香蕉的珂珂]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144275406</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144275406</guid><author>J_pluto</author><pubDate>Thu, 05 Dec 2024 21:27:07 +0800</pubDate><description><![CDATA[【代码】【二分查找】力扣 875. 爱吃香蕉的珂珂。]]></description><category></category></item><item><title><![CDATA[【二分查找】力扣 275. H 指数 II]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144174305</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144174305</guid><author>J_pluto</author><pubDate>Sun, 01 Dec 2024 20:55:11 +0800</pubDate><description><![CDATA[【代码】【二分查找】力扣 275. H 指数 II。]]></description><category></category></item><item><title><![CDATA[【链表】力扣 2816. 翻倍以链表形式表示的数字]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144171379</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144171379</guid><author>J_pluto</author><pubDate>Sun, 01 Dec 2024 19:01:35 +0800</pubDate><description><![CDATA[由于链表存储数值采取的不是逆序的，与我们正常进行运算的顺序是相反的。但是根据本题中多出的先验知识，我们可以来避免进行的步骤。根据上述表格可知，当节点的数值时才会有进位。因此，在不反转链表的情况下，只需要判断下一个节点的值与 4 的关系就可以确定当前节点是否要加进位 1。特别地，当头结点的数值大于 4 时，需要新创建一个节点来存储翻倍后进位产生的数值。]]></description><category></category></item><item><title><![CDATA[【反转链表】力扣 445. 两数相加 II]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144134123</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144134123</guid><author>J_pluto</author><pubDate>Fri, 29 Nov 2024 13:54:52 +0800</pubDate><description><![CDATA[【代码】【反转链表】力扣 2. 两数相加。]]></description><category></category></item><item><title><![CDATA[【链表】力扣 2. 两数相加]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144130814</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144130814</guid><author>J_pluto</author><pubDate>Fri, 29 Nov 2024 13:34:15 +0800</pubDate><description><![CDATA[【代码】【链表】力扣 2. 两数相加。]]></description><category></category></item><item><title><![CDATA[【二分查找】力扣 2529. 正整数和负整数的最大计数]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144116761</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144116761</guid><author>J_pluto</author><pubDate>Thu, 28 Nov 2024 17:44:17 +0800</pubDate><description><![CDATA[【代码】【二分查找】力扣 2529. 正整数和负整数的最大计数。]]></description><category></category></item><item><title><![CDATA[【二分查找】力扣 34. 在排序数组中查找元素的第一个和最后一个位置]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/144114784</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/144114784</guid><author>J_pluto</author><pubDate>Thu, 28 Nov 2024 16:36:47 +0800</pubDate><description><![CDATA[将题目转化为求解 target - 1 和 target + 1 的查找。分别采用最基础的二分查找即可。]]></description><category></category></item><item><title><![CDATA[【回溯】力扣216.组合优化III]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/139696996</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/139696996</guid><author>J_pluto</author><pubDate>Thu, 31 Oct 2024 21:01:00 +0800</pubDate><description><![CDATA[的基础上，可选数字变为1到9，多了一个约束条件为已选数字总和为 n。]]></description><category></category></item><item><title><![CDATA[【回溯】力扣 77.组合]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/143376128</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/143376128</guid><author>J_pluto</author><pubDate>Thu, 31 Oct 2024 16:52:35 +0800</pubDate><description><![CDATA[采用回溯算法，注意点：]]></description><category></category></item><item><title><![CDATA[【动态规划】力扣198.打家劫舍]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/143244224</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/143244224</guid><author>J_pluto</author><pubDate>Sun, 27 Oct 2024 22:09:06 +0800</pubDate><description><![CDATA[题目中指出不可以选相邻的房间，说明如果选了第 1 间，那么第 2 间一定不可以选，第 3 间房间可以选，也可以不选……假设是按照从第 1 间房间开始依次往后选，每一间房间的选择都会影响到后面的房间可不可以被选择。在递归的基础上，创建一个数组 dp[] 来存储之前计算过的结果，避免重复计算。但这样提交会发现超时。]]></description><category></category></item><item><title><![CDATA[【动态规划】力扣509. 斐波那契数]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/143254373</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/143254373</guid><author>J_pluto</author><pubDate>Sat, 26 Oct 2024 16:36:36 +0800</pubDate><description><![CDATA[【代码】【动态规划】力扣509. 斐波那契数。]]></description><category></category></item><item><title><![CDATA[【动态规划】力扣 70. 爬楼梯]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/143255727</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/143255727</guid><author>J_pluto</author><pubDate>Sat, 26 Oct 2024 16:35:51 +0800</pubDate><description><![CDATA[【代码】【动态规划】力扣 70. 爬楼梯。]]></description><category></category></item><item><title><![CDATA[力扣 167. 两数之和 II - 输入有序数组]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/143202702</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/143202702</guid><author>J_pluto</author><pubDate>Thu, 24 Oct 2024 10:44:45 +0800</pubDate><description><![CDATA[的，利用该先验知识，可以设置两个指针在数组的起始和末尾，相向前进，与暴力枚举相比可以加快寻找速度。]]></description><category></category></item><item><title><![CDATA[【滑动窗口】力扣 3. 无重复字符的最长子串]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/143193587</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/143193587</guid><author>J_pluto</author><pubDate>Wed, 23 Oct 2024 21:14:32 +0800</pubDate><description><![CDATA[滑动窗口，将字符采用ASCII码存储相应出现次数。]]></description><category></category></item><item><title><![CDATA[【思维陷阱】力扣 111. 二叉树的最小深度]]></title><link>https://blog.youkuaiyun.com/J_pluto/article/details/143178713</link><guid>https://blog.youkuaiyun.com/J_pluto/article/details/143178713</guid><author>J_pluto</author><pubDate>Wed, 23 Oct 2024 19:57:09 +0800</pubDate><description><![CDATA[求解二叉树最大深度后的 思维陷阱]]></description><category></category></item></channel></rss>