# LeetCode 热题 HOT 100

- [\[1.两数之和\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/1.两数之和.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/1.-liang-shu-zhi-he-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-1001.-liang-shu-zhi-he--md.md)
- [\[105. 从前序与中序遍历序列构造二叉树\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/105. 从前序与中序遍历序列构造二叉树.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/105.-cong-qian-xu-yu-zhong-xu-bian-li-xu-lie-gou-zao-er-cha-shu-1java-kai-fa-suan-fa-ti-mu-leetcode2.md)
- [\[11.盛水最多的容器\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/11.盛水最多的容器.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/11.-sheng-shui-zui-duo-de-rong-qi-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10011.-sheng-shui.md)
- [\[114. 二叉树展开为链表\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/114. 二叉树展开为链表.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/114.-er-cha-shu-zhan-kai-wei-lian-biao-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100114.-er-ch.md)
- [\[121. 买卖股票的最佳时机\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/121. 买卖股票的最佳时机.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/121.-mai-mai-gu-piao-de-zui-jia-shi-ji-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100121.-mai-m.md)
- [\[139. 单词拆分\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/139. 单词拆分.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/139.-dan-ci-chai-fen-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100139.-dan-ci-chai-fen--md.md)
- [\[146. LRU缓存\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/146. LRU缓存.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/146.-lru-huan-cun-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100146.-lru-huan-cun--md.md)
- [\[17. 电话号码的字母组合\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/17. 电话号码的字母组合.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/17.-dian-hua-hao-ma-de-zi-mu-zu-he-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10017.-dian-hua-h.md)
- [\[19. 删除链表的倒数第 N 个结点\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/19. 删除链表的倒数第 N 个结点.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/19.-shan-chu-lian-biao-de-dao-shu-di-n-ge-jie-dian-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-1.md)
- [\[198. 打家劫舍\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/198. 打家劫舍.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/198.-da-jia-jie-she-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100198.-da-jia-jie-she--md.md)
- [\[2.两数相加\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/2.两数相加.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/2.-liang-shu-xiang-jia-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-1002.-liang-shu-xiang-jia--md.md)
- [\[20. 有效的括号\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/20. 有效的括号.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/20.-you-xiao-de-kuo-hao-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10020.-you-xiao-de-kuo-hao-..md)
- [\[200. 岛屿数量\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/200. 岛屿数量.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/200.-dao-yu-shu-liang-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100200.-dao-yu-shu-liang--md.md)
- [\[207. 课程表\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/207. 课程表.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/207.-ke-cheng-biao-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100207.-ke-cheng-biao--md.md)
- [\[21.合并两个有序链表\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/21.合并两个有序链表.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/21.-he-bing-liang-ge-you-xu-lian-biao-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10021.-he-bing.md)
- [\[22. 括号生成\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/22. 括号生成.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/22.-kuo-hao-sheng-cheng-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10022.-kuo-hao-sheng-cheng-..md)
- [\[226. 翻转二叉树\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/226. 翻转二叉树.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/226.-fan-zhuan-er-cha-shu-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100226.-fan-zhuan-er-cha-s.md)
- [\[234. 回文链表\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/234. 回文链表.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/234.-hui-wen-lian-biao-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100234.-hui-wen-lian-biao--md.md)
- [\[283. 移动零\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/283. 移动零.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/283.-yi-dong-ling-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100283.-yi-dong-ling--md.md)
- [\[3.无重复字符的最长子串\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/3.无重复字符的最长子串.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/3.-wu-chong-fu-zi-fu-de-zui-zhang-zi-chuan-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-1003.-wu.md)
- [\[300. 最长递增子序列\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/300. 最长递增子序列.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/300.-zui-chang-di-zeng-zi-xu-lie-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100300.-zui-chang-d.md)
- [\[337. 打家劫舍 III\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/337. 打家劫舍 III.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/337.-da-jia-jie-she-iii1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100337.-da-jia-jie-she-iii-md.md)
- [\[34. 在排序数组中查找元素的第一个和最后一个位置\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/34. 在排序数组中查找元素的第一个和最后一个位置.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/34.-zai-pai-xu-shu-zu-zhong-cha-zhao-yuan-su-de-di-yi-ge-he-zui-hou-yi-ge-wei-zhi-1java-kai-fa-suan.md)
- [\[39. 组合总和\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/39. 组合总和.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/39.-zu-he-zong-he-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10039.-zu-he-zong-he--md.md)
- [\[48. 旋转图像\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/48. 旋转图像.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/48.-xuan-zhuan-tu-xiang-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10048.-xuan-zhuan-tu-xiang-..md)
- [\[5.最长回文子串\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/5.最长回文子串.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/5.-zui-chang-hui-wen-zi-chuan-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-1005.-zui-chang-hui-we.md)
- [\[53. 最大子数组和\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/53. 最大子数组和.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/53.-zui-da-zi-shu-zu-he-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10053.-zui-da-zi-shu-zu-he-..md)
- [\[543. 二叉树的直径\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/543. 二叉树的直径.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/543.-er-cha-shu-de-zhi-jing-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100543.-er-cha-shu-de-zh.md)
- [\[55. 跳跃游戏\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/55. 跳跃游戏.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/55.-tiao-yue-you-xi-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10055.-tiao-yue-you-xi--md.md)
- [\[56. 合并区间\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/56. 合并区间.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/56.-he-bing-qu-jian-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10056.-he-bing-qu-jian--md.md)
- [\[64. 最小路径和\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/64. 最小路径和.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/64.-zui-xiao-lu-jing-he-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10064.-zui-xiao-lu-jing-he-..md)
- [\[739. 每日温度\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/739. 每日温度.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/739.-mei-ri-wen-du-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-100739.-mei-ri-wen-du--md.md)
- [\[78. 子集\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/78. 子集.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/78.-zi-ji-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10078.-zi-ji--md.md)
- [\[96. 不同的二叉搜索树\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/96. 不同的二叉搜索树.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/96.-bu-tong-de-er-cha-sou-suo-shu-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10096.-bu-tong-de.md)
- [\[98. 验证二叉搜索树\](1-Java开发/算法题目/LeetCode%20热题 HOT 100/98. 验证二叉搜索树.md)](https://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100/98.-yan-zheng-er-cha-sou-suo-shu-1java-kai-fa-suan-fa-ti-mu-leetcode20-re-ti-hot-10098.-yan-zheng-er.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://qiangrens-organization.gitbook.io/qkd90/java-kai-fa/suan-fa-ti-mu/leetcode-re-ti-hot-100.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.