<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_56281949的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_56281949</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_56281949]]></copyright><item><title><![CDATA[栈和队列定义及常用语法 LeetCode]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/157256901</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/157256901</guid><author>qq_56281949</author><pubDate>Mon, 26 Jan 2026 15:53:25 +0800</pubDate><description><![CDATA[栈顶。]]></description><category></category></item><item><title><![CDATA[代码随想录——哈希表]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/157176505</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/157176505</guid><author>qq_56281949</author><pubDate>Thu, 22 Jan 2026 14:06:11 +0800</pubDate><description><![CDATA[1.有效的字母异位词，]]></description><category></category></item><item><title><![CDATA[代码随想录LeetCode题目记录]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/157134692</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/157134692</guid><author>qq_56281949</author><pubDate>Mon, 19 Jan 2026 17:09:29 +0800</pubDate><description><![CDATA[4.删除链表的倒数第N个结点（LeetCode Hot100）3.两两交换链表中的结点（LeetCode Hot100）5.相交链表（LeetCode Hot100）面试题。2.反转链表（LeetCode Hot100）6.环形链表（LeetCode Hot100）]]></description><category></category></item><item><title><![CDATA[Arrays.sort() 三种常用用法+举例]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/157031901</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/157031901</guid><author>qq_56281949</author><pubDate>Fri, 16 Jan 2026 18:52:12 +0800</pubDate><description><![CDATA[/ 默认升序// 自定义降序int age;// 规则：先按 age 升序；age 相同按 name 字典序升序if (p1.age!});注意：比较字符串用compareTo，不要用==。三.二维数组int[ ] [ ] （算法题高频：按列、多关键字）3.1 按第0列（start)升序。]]></description><category></category></item><item><title><![CDATA[LeetCode 数组经典题刷题]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/157024405</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/157024405</guid><author>qq_56281949</author><pubDate>Fri, 16 Jan 2026 14:14:09 +0800</pubDate><description><![CDATA[4.长度最小的子数组。]]></description><category></category></item><item><title><![CDATA[LeetCode 二叉树的最大深度 递归+层序遍历]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156912419</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156912419</guid><author>qq_56281949</author><pubDate>Tue, 13 Jan 2026 20:25:43 +0800</pubDate><description><![CDATA[queue.offer()  入队；]]></description><category></category></item><item><title><![CDATA[LeetCode 删除链表的倒数第N个结点]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156763081</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156763081</guid><author>qq_56281949</author><pubDate>Fri, 09 Jan 2026 14:26:07 +0800</pubDate><description><![CDATA[【代码】LeetCode 删除。]]></description><category></category></item><item><title><![CDATA[LeetCode 链表两数相加]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156734186</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156734186</guid><author>qq_56281949</author><pubDate>Fri, 09 Jan 2026 13:13:43 +0800</pubDate><description><![CDATA[【代码】LeetCode 链表两数相加。]]></description><category></category></item><item><title><![CDATA[LeetCode 移动零元素 快慢指针]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156729205</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156729205</guid><author>qq_56281949</author><pubDate>Thu, 08 Jan 2026 17:15:04 +0800</pubDate><description><![CDATA[这里采用快慢指针做法，定义两个指针，快指针用来寻找不是0的元素，再和慢指针进行对换位置，因为。]]></description><category></category></item><item><title><![CDATA[LeetCode 环形链表+升级版环形链表]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156726139</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156726139</guid><author>qq_56281949</author><pubDate>Thu, 08 Jan 2026 15:33:49 +0800</pubDate><description><![CDATA[这道题我采用哈希表的形式，注意哈希表的一个特点是如果元素已经存在则不能添加，见。最初我采用动态数组的方式有些测试用例过不去，利用哈希表这个特性可以使用。判断链表是否为环形链表。]]></description><category></category></item><item><title><![CDATA[LeetCode 回文链表]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156724048</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156724048</guid><author>qq_56281949</author><pubDate>Thu, 08 Jan 2026 14:33:40 +0800</pubDate><description><![CDATA[这里有用到关于List集合的知识，可看上一篇。]]></description><category></category></item><item><title><![CDATA[Java 数组与集合（List, Set, Map）获取长度与遍历操作]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156722510</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156722510</guid><author>qq_56281949</author><pubDate>Thu, 08 Jan 2026 14:27:02 +0800</pubDate><description><![CDATA[List是一个有序集合，元素按照插入顺序排列，可以通过索引来访问list中允许有重复的元素通常存储同一类型的元素set是一个无序集合，元素没有固定的顺序，不能通过索引来访问元素set中元素唯一，不能有重复元素通常存储同一类型的元素Map存储的是键值对(key-value)，每个键都与一个值关联Map中的每个key唯一，但是值可以重复Map通常无序，但可以通过不同的实现类保证顺序。]]></description><category></category></item><item><title><![CDATA[LeetCode反转链表 ]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156720469</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156720469</guid><author>qq_56281949</author><pubDate>Thu, 08 Jan 2026 13:01:12 +0800</pubDate><description><![CDATA[【代码】LeetCode反转链表。]]></description><category></category></item><item><title><![CDATA[Leetcode 二叉树中序遍历 前序遍历 后序遍历（递归）]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156692824</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156692824</guid><author>qq_56281949</author><pubDate>Wed, 07 Jan 2026 17:34:46 +0800</pubDate><description><![CDATA[【代码】Leetcode 二叉树中序遍历 前序遍历 后序遍历（递归）]]></description><category></category></item><item><title><![CDATA[LeetCode 合并两个有序链表]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156650623</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156650623</guid><author>qq_56281949</author><pubDate>Wed, 07 Jan 2026 16:16:25 +0800</pubDate><description><![CDATA[比较L1和L2,让prev指向小数字的那个链表，同时小数字链表往后移动，然后prev=prev->next，最后如果有一个链表遍历完了，那么再遍历另一个链表就可以了。再建立一个头指针prev。先创建一个虚拟的头结点。]]></description><category></category></item><item><title><![CDATA[Leetcode 有效括号 栈]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156648085</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156648085</guid><author>qq_56281949</author><pubDate>Tue, 06 Jan 2026 14:38:34 +0800</pubDate><description><![CDATA[Stack.peek()：弹出栈顶元素但不删除。Stack.pop()：弹出栈顶元素并删除。Stack.push()：压入栈中。]]></description><category></category></item><item><title><![CDATA[LeetCode 两数之和 Java]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/156645791</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/156645791</guid><author>qq_56281949</author><pubDate>Tue, 06 Jan 2026 13:46:04 +0800</pubDate><description><![CDATA[包括暴力解法和哈希表（包含各人理解）两种解法。]]></description><category></category></item><item><title><![CDATA[测试必备——HTML]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/154173445</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/154173445</guid><author>qq_56281949</author><pubDate>Fri, 31 Oct 2025 16:54:18 +0800</pubDate><description><![CDATA[HTML是超文本标记语言，由单标签和双标签组成，可通过属性描述特征。主要标签包括：标题标签&lt;h&gt;、段落标签&lt;p&gt;（具有换行功能）、超链接&lt;a&gt;（设置href跳转和target打开方式）、图片&lt;img&gt;（支持相对路径）、布局标签&lt;div&gt;和&lt;span&gt;、列表标签ol/ul。表单通过&lt;input&gt;创建文本框、密码框、单/复选框，并使用&lt;form&gt;提交数据，其中method属性指定get/post方式：get适合查询（]]></description><category></category></item><item><title><![CDATA[缺陷编写及分析]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/154142350</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/154142350</guid><author>qq_56281949</author><pubDate>Thu, 30 Oct 2025 20:42:13 +0800</pubDate><description><![CDATA[面试题：发现缺陷后，首先怎么办？答案：确认bug可复现，确认是Bug。提交时，要检查缺陷是否已经存在。]]></description><category></category></item><item><title><![CDATA[缺陷（定义、判定标准、产生原因、生命周期）]]></title><link>https://blog.youkuaiyun.com/qq_56281949/article/details/154130406</link><guid>https://blog.youkuaiyun.com/qq_56281949/article/details/154130406</guid><author>qq_56281949</author><pubDate>Thu, 30 Oct 2025 16:13:04 +0800</pubDate><description><![CDATA[【摘要】软件缺陷指未实现需求功能、出现不应有错误、功能超出需求范围、遗漏隐性需求或用户体验差等问题。缺陷产生原因多样，其生命周期包括发现、修复等环节，且修复过程可能引入新缺陷。]]></description><category></category></item></channel></rss>