<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[This_is_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/This_is_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; This_is_]]></copyright><item><title><![CDATA[RabbitMQ学习笔记]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132147650</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132147650</guid><author>This_is_</author><pubDate>Thu, 04 Sep 2025 16:06:01 +0800</pubDate><description><![CDATA[地址: http://宿主机的IP:15672。看到如下界面即登录成功。默认账号:guest。默认密码:guest。]]></description><category></category></item><item><title><![CDATA[调用大模型API-文心一言]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/141401205</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/141401205</guid><author>This_is_</author><pubDate>Wed, 21 Aug 2024 19:39:56 +0800</pubDate><description><![CDATA[为例，选择“HTTP请求调用”，把第一步创建应用的 应用API Key、应用Secret Key替换到代码中，即可进行单轮对话。每次请求调用5轮之前的会话，并且把response保存在会话记录参与到下一轮的调用。，点击应用接入-创建应用；]]></description><category></category></item><item><title><![CDATA[HOT100-438. 找到字符串中所有字母异位词]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/135917186</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/135917186</guid><author>This_is_</author><pubDate>Mon, 29 Jan 2024 17:25:37 +0800</pubDate><description><![CDATA[起始索引等于 0 的子串是 "cba", 它是 "abc" 的异位词。起始索引等于 6 的子串是 "bac", 它是 "abc" 的异位词。的子串，返回这些子串的起始索引。不考虑答案输出的顺序。指由相同字母重排列形成的字符串（包括相同的字符串）。438. 找到字符串中所有字母异位词。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day32]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/133321265</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/133321265</guid><author>This_is_</author><pubDate>Tue, 26 Sep 2023 19:28:23 +0800</pubDate><description><![CDATA[今日刷到二分查找，以前做过的题忘的一干二净；庆幸自己用新的方法做了出来两道“中等”题；（我都能做出来我认为应该标“简单”）由于之前题的难度基本在抄答案，所以停更几天。今天没抄答案就更新一下。]]></description><category></category></item><item><title><![CDATA[LeetCode-回溯算法]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/133213641</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/133213641</guid><author>This_is_</author><pubDate>Sat, 23 Sep 2023 19:55:18 +0800</pubDate><description><![CDATA[应用回溯法求解问题时，首先应该明确 问题的解空间。一个复杂问题的解决往往由多部分构成，即，一个大的解决方案 可以看作是由若干个小的决策组成。解决一个 问题的所有可能的决策序列构成该问题的解空间。解空间中满足约束条件的决策 序列称为可行解。一般说来，求解任何问题都有一个目标，在约束条件下使目标 值达到最大(或最小)的可行解称为该问题的最优解。在解空间中，前 k 项决策 已经取定的所有决策序列之集称为 k 定子解空间。0 定子解空间即是该问题的解 空间。的字符串，返回所有它能表示的字母组合。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day31]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132980454</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132980454</guid><author>This_is_</author><pubDate>Mon, 18 Sep 2023 15:18:40 +0800</pubDate><description><![CDATA[105. 从前序与中序遍历序列构造二叉树。，请构造二叉树并返回其根节点。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day30]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132915953</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132915953</guid><author>This_is_</author><pubDate>Sat, 16 Sep 2023 10:56:57 +0800</pubDate><description><![CDATA[114. 二叉树展开为链表。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day29]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132896961</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132896961</guid><author>This_is_</author><pubDate>Fri, 15 Sep 2023 10:38:09 +0800</pubDate><description><![CDATA[199. 二叉树的右视图给定一个二叉树的root，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。[1,3,4]]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day28]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132872138</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132872138</guid><author>This_is_</author><pubDate>Thu, 14 Sep 2023 11:07:46 +0800</pubDate><description><![CDATA[判断其是否是一个有效的二叉搜索树。给你一个二叉树的根节点。98. 验证二叉搜索树。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day27]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132848447</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132848447</guid><author>This_is_</author><pubDate>Wed, 13 Sep 2023 11:18:56 +0800</pubDate><description><![CDATA[2. 二叉树的层序遍历给你二叉树的根节点root，返回其节点值的。（即逐层地，从左到右访问所有节点）。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day26]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132830442</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132830442</guid><author>This_is_</author><pubDate>Tue, 12 Sep 2023 13:54:08 +0800</pubDate><description><![CDATA[3 ，取路径 [4,2,1,3] 或 [5,2,1,3] 的长度。这条路径可能经过也可能不经过根节点。是指树中任意两个节点之间最长路径的。给你一棵二叉树的根节点，返回该树的。由它们之间边数表示。43. 二叉树的直径。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day25]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132807386</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132807386</guid><author>This_is_</author><pubDate>Mon, 11 Sep 2023 14:50:43 +0800</pubDate><description><![CDATA[给你一个二叉树的根节点。， 检查它是否轴对称。101. 对称二叉树。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day24]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132791070</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132791070</guid><author>This_is_</author><pubDate>Sun, 10 Sep 2023 14:48:19 +0800</pubDate><description><![CDATA[226. 翻转二叉树给你一棵二叉树的根节点root，翻转这棵二叉树，并返回其根节点。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day23]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132783471</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132783471</guid><author>This_is_</author><pubDate>Sat, 09 Sep 2023 22:58:17 +0800</pubDate><description><![CDATA[104. 二叉树的最大深度给定一个二叉树root，返回其最大深度。二叉树的是指从根节点到最远叶子节点的最长路径上的节点数。3。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day22]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132757321</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132757321</guid><author>This_is_</author><pubDate>Fri, 08 Sep 2023 16:28:46 +0800</pubDate><description><![CDATA[146. LRU 缓存请你设计并实现一个满足约束的数据结构。实现LRUCachecapacitykey-1keyvaluekey-valuecapacity函数get和put必须以O(1)的平均时间复杂度运行。// 缓存是 {1=1}// 缓存是 {1=1, 2=2}// 返回 1// 该操作会使得关键字 2 作废，缓存是 {1=1, 3=3}// 返回 -1 (未找到)// 该操作会使得关键字 1 作废，缓存是 {4=4, 3=3}// 返回 -1 (未找到)// 返回 3。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day21]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132739395</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132739395</guid><author>This_is_</author><pubDate>Thu, 07 Sep 2023 15:42:34 +0800</pubDate><description><![CDATA[24. 两两交换链表中的节点给你一个链表，两两交换其中相邻的节点，并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题（即，只能进行节点交换）。[2,1,4,3]]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day20]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132715698</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132715698</guid><author>This_is_</author><pubDate>Wed, 06 Sep 2023 15:02:58 +0800</pubDate><description><![CDATA[给你一个链表，删除链表的倒数第。个结点，并且返回链表的头结点。删除链表的倒数第 N 个结点。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day19]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132694613</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132694613</guid><author>This_is_</author><pubDate>Tue, 05 Sep 2023 16:49:23 +0800</pubDate><description><![CDATA[新链表是通过拼接给定的两个链表的所有节点组成的。你可以假设除了数字 0 之外，这两个数都不会以 0 开头。的链表，表示两个非负的整数。它们每位数字都是按照。请你将两个数相加，并以相同形式返回一个表示和的链表。的方式存储的，并且每个节点只能存储。将两个升序链表合并为一个新的。21. 合并两个有序链表。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day18]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132665172</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132665172</guid><author>This_is_</author><pubDate>Mon, 04 Sep 2023 11:27:30 +0800</pubDate><description><![CDATA[234. 回文链表141. 环形链表142. 环形链表 II。]]></description><category></category></item><item><title><![CDATA[LeetCode-热题100-笔记-day17]]></title><link>https://blog.youkuaiyun.com/This_is_/article/details/132652089</link><guid>https://blog.youkuaiyun.com/This_is_/article/details/132652089</guid><author>This_is_</author><pubDate>Sun, 03 Sep 2023 17:06:04 +0800</pubDate><description><![CDATA[的输入如下（你设计的程序。]]></description><category></category></item></channel></rss>