<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[weixin_44146142的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/weixin_44146142</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; weixin_44146142]]></copyright><item><title><![CDATA[Day36(贪心)|435. 无重叠区间]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128797388</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128797388</guid><author>weixin_44146142</author><pubDate>Mon, 30 Jan 2023 10:17:59 +0800</pubDate><description><![CDATA[【代码】Day36(贪心)|435. 无重叠区间。]]></description><category></category></item><item><title><![CDATA[Day35(贪心)|860. 柠檬水找零 406. 根据身高重建队列 452. 用最少数量的箭引爆气球]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128784482</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128784482</guid><author>weixin_44146142</author><pubDate>Sun, 29 Jan 2023 10:09:20 +0800</pubDate><description><![CDATA[【代码】Day35(贪心)|860. 柠檬水找零 406. 根据身高重建队列 452. 用最少数量的箭引爆气球。]]></description><category></category></item><item><title><![CDATA[Day34(贪心)|1005. K 次取反后最大化的数组和 134. 加油站 135. 分发糖果]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128774601</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128774601</guid><author>weixin_44146142</author><pubDate>Sat, 28 Jan 2023 09:26:37 +0800</pubDate><description><![CDATA[【代码】Day34(贪心)|1005. K 次取反后最大化的数组和 134. 加油站 135. 分发糖果。]]></description><category></category></item><item><title><![CDATA[Day32(贪心)|122. 买卖股票的最佳时机 II 55. 跳跃游戏 45. 跳跃游戏 II]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128700535</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128700535</guid><author>weixin_44146142</author><pubDate>Mon, 16 Jan 2023 10:32:58 +0800</pubDate><description><![CDATA[【代码】Day32(贪心)|122. 买卖股票的最佳时机 II 55. 跳跃游戏 45. 跳跃游戏 II。]]></description><category></category></item><item><title><![CDATA[Day31(贪心)|初步了解 455. 分发饼干 376. 摆动序列 53. 最大子数组和]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128654069</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128654069</guid><author>weixin_44146142</author><pubDate>Thu, 12 Jan 2023 10:18:03 +0800</pubDate><description><![CDATA[贪心算法是规划类问题的一种思路，当问题可以拆成子问题，通过每个子问题最优获得全局最优且没有反例的时候可以尝试贪心算法。]]></description><category></category></item><item><title><![CDATA[Day29(回溯)|491. 递增子序列 46. 全排列 47. 全排列 II]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128625190</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128625190</guid><author>weixin_44146142</author><pubDate>Tue, 10 Jan 2023 11:32:36 +0800</pubDate><description><![CDATA[【代码】Day29(回溯)|491. 递增子序列 46. 全排列 47. 全排列 II。]]></description><category></category></item><item><title><![CDATA[Day28(回溯)|93. 复原 IP 地址 78. 子集 90. 子集 II]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128609010</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128609010</guid><author>weixin_44146142</author><pubDate>Mon, 09 Jan 2023 10:54:06 +0800</pubDate><description><![CDATA[【代码】Day28(回溯)|93. 复原 IP 地址 78. 子集 90. 子集 II。]]></description><category></category></item><item><title><![CDATA[Day27(回溯)|39. 组合总和 40. 组合总和 II 131. 分割回文串]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128603999</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128603999</guid><author>weixin_44146142</author><pubDate>Sun, 08 Jan 2023 20:26:01 +0800</pubDate><description><![CDATA[【代码】Day27(回溯)|39. 组合总和 40. 组合总和 II 131. 分割回文串。]]></description><category></category></item><item><title><![CDATA[Day25(回溯)|216. 组合总和 III 17. 电话号码的字母组合]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128558123</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128558123</guid><author>weixin_44146142</author><pubDate>Thu, 05 Jan 2023 10:29:16 +0800</pubDate><description><![CDATA[【代码】Day25(回溯)|216. 组合总和 III 17. 电话号码的字母组合。]]></description><category></category></item><item><title><![CDATA[Day24(回溯)|回溯法介绍 77. 组合]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128543763</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128543763</guid><author>weixin_44146142</author><pubDate>Wed, 04 Jan 2023 11:07:43 +0800</pubDate><description><![CDATA[回溯是一种搜索方法，是递归的副产物，一般会和递归一起出现回溯的算法效率并不算很高，本质上是加入剪枝的穷举算法回溯法适合什么场景：（只能靠暴力搜索才能解决的问题，用回溯引入剪枝能稍微快一点）组合问题：N个数里面按一定规则找出k个数的集合切割问题：一个字符串按一定规则有几种切割方式子集问题：一个N个数的集合里有多少符合条件的子集排列问题：N个数按一定规则全排列，有几种排列方式棋盘问题：N皇后，解数独等等回溯算法都可以抽象成树结构回溯法模板：三部曲。]]></description><category></category></item><item><title><![CDATA[Day23(二叉树)|669. 修剪二叉搜索树 108. 将有序数组转换为二叉搜索树 538. 把二叉搜索树转换为累加树]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128528517</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128528517</guid><author>weixin_44146142</author><pubDate>Tue, 03 Jan 2023 10:27:55 +0800</pubDate><description><![CDATA[二叉树部分总结（待补充）]]></description><category></category></item><item><title><![CDATA[Day22(二叉树)|235. 二叉搜索树的最近公共祖先 701. 二叉搜索树中的插入操作 450. 删除二叉搜索树中的节点]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128518149</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128518149</guid><author>weixin_44146142</author><pubDate>Mon, 02 Jan 2023 11:06:08 +0800</pubDate><description><![CDATA[【代码】Day22(二叉树)|235. 二叉搜索树的最近公共祖先 701. 二叉搜索树中的插入操作 450. 删除二叉搜索树中的节点]]></description><category></category></item><item><title><![CDATA[Day21(二叉树)|530. 二叉搜索树的最小绝对差 501. 二叉搜索树中的众数 236. 二叉树的最近公共祖先]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128490738</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128490738</guid><author>weixin_44146142</author><pubDate>Fri, 30 Dec 2022 10:10:22 +0800</pubDate><description><![CDATA[二叉搜索树的性质应用，可以通过遍历变成有序数组，就可以完成找最值，差值等操作通过定义pre，cur指针并更新的方法可以不适用额外空间存放遍历的有序数组。]]></description><category></category></item><item><title><![CDATA[Day20(二叉树)|654. 最大二叉树 617. 合并二叉树 700. 二叉搜索树中的搜索 98. 验证二叉搜索树]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128477491</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128477491</guid><author>weixin_44146142</author><pubDate>Thu, 29 Dec 2022 11:48:41 +0800</pubDate><description><![CDATA[二叉树和二叉搜索树的一些问题，主要思路都是递归。]]></description><category></category></item><item><title><![CDATA[Day18(二叉树)|513. 找树左下角的值 112. 路径总和 106. 从中序与后序遍历序列构造二叉树]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128464511</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128464511</guid><author>weixin_44146142</author><pubDate>Wed, 28 Dec 2022 10:42:26 +0800</pubDate><description><![CDATA[二叉树递归加回溯的问题，首先确定递归的三步走，参数返回值，终止条件和单层逻辑，然后确定怎么回溯，一般是在递归单层并不满足终止条件时要做回溯。]]></description><category></category></item><item><title><![CDATA[Day17(二叉树)|110. 平衡二叉树 257. 二叉树的所有路径 404. 左叶子之和]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128452729</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128452729</guid><author>weixin_44146142</author><pubDate>Tue, 27 Dec 2022 12:14:01 +0800</pubDate><description><![CDATA[Day17]]></description><category></category></item><item><title><![CDATA[Day16(二叉树)|104. 二叉树的最大深度 111. 二叉树的最小深度 222. 完全二叉树的节点个数]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128404834</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128404834</guid><author>weixin_44146142</author><pubDate>Thu, 22 Dec 2022 10:29:04 +0800</pubDate><description><![CDATA[今天三道题主要都是递归应用，核心是搞清楚每一步递归要做什么和终止条件。]]></description><category></category></item><item><title><![CDATA[Day15(二叉树)|102. 二叉树的层序遍历]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128392687</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128392687</guid><author>weixin_44146142</author><pubDate>Wed, 21 Dec 2022 10:24:47 +0800</pubDate><description><![CDATA[Day15]]></description><category></category></item><item><title><![CDATA[Day14(二叉树)|144/145/94.二叉树前后中序遍历]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128387712</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128387712</guid><author>weixin_44146142</author><pubDate>Tue, 20 Dec 2022 17:26:13 +0800</pubDate><description><![CDATA[二叉树的三种遍历方式，需要掌握递归方法时的条件设置。]]></description><category></category></item><item><title><![CDATA[Day13(栈与队列)|239. 滑动窗口最大值 347.前 K 个高频元素]]></title><link>https://blog.youkuaiyun.com/weixin_44146142/article/details/128370568</link><guid>https://blog.youkuaiyun.com/weixin_44146142/article/details/128370568</guid><author>weixin_44146142</author><pubDate>Mon, 19 Dec 2022 11:39:25 +0800</pubDate><description><![CDATA[今天的两道题比较难，涉及到的思路之前没见过，分别是自定义单调队列和大小顶堆的应用，一刷的时候主要理解了题解思路，后面再刷的时候尽量能自己写出来代码。]]></description><category></category></item></channel></rss>