# 第三章 - 精选题解

这里是我以前写的题解。 这里的题解一般都是多个题目，而不是针对某一具体题目的。熟悉我的朋友应该知道了， 这是我所说的**第二阶段** 。

第一阶段按照 tag 去刷， 第二阶段则要一题多解，多题同解，挖掘题目背后的东西。而这个系列大多数就是做了这个事情。其他不是**一题多解，多题同解**的，基本就是**大厂真题解析**。

* [《日程安排》专题](https://github.com/azl397985856/leetcode/tree/1fce788bab7e7e2a10a6dfb0ee55a2bb09424b0b/selected/schedule-topic.md)
* [《构造二叉树》专题](https://github.com/azl397985856/leetcode/tree/1fce788bab7e7e2a10a6dfb0ee55a2bb09424b0b/selected/construct-binary-tree.md)
* [字典序列删除](/leetcode-solution/selected/a-deleted.md)
* [百度的算法面试题 - 祖玛游戏](https://github.com/azl397985856/leetcode/tree/1fce788bab7e7e2a10a6dfb0ee55a2bb09424b0b/selected/zuma-game.md)
* [西法的刷题秘籍】一次搞定前缀和](/leetcode-solution/selected/atmostk.md)
* [字节跳动的算法面试题是什么难度？](/leetcode-solution/selected/byte-dance-algo-ex.md)
* [字节跳动的算法面试题是什么难度？（第二弹）](/leetcode-solution/selected/byte-dance-algo-ex-2017.md)
* [《我是你的妈妈呀》 - 第一期](/leetcode-solution/selected/mother-01.md)
* [一文带你看懂二叉树的序列化](/leetcode-solution/selected/serialize.md)
* [穿上衣服我就不认识你了？来聊聊最长上升子序列](/leetcode-solution/selected/lis.md)
* [你的衣服我扒了 - 《最长公共子序列》](/leetcode-solution/selected/lcs.md)
* [一文看懂《最大子序列和问题》](/leetcode-solution/selected/lss.md)
* [状压 DP 入门](/leetcode-solution/medium/464.can-i-win.md)
* [一行代码就可以 AC](/leetcode-solution/medium/1227.airplane-seat-assignment-probability.md)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/selected.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.
