# LeetCode

工程算法在更多的面试考核中越来越重要。我的亲身体验是，刷过了比较多的题目之后，对于数据结构的运用会愈发娴熟。

不过，仅仅是刷题，但不注重归纳总结的话，并不能完整认为是掌握了知识。

于是我打算利用碎片的时间，开始一道题一道题的巩固算法题，并尽量采用多种方法来实现，而不仅仅追求一次AC。

本 blog 将按照以下规则进行整理：

1. 相同类型的题目会被归类为一个 Group
2. 数字标号对应 LeetCode 的题目
3. E 对应 Easy / M 对应 Medium / H 对应 Hard


---

# 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.ricky.moe/master.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.