<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>LeetCode题 - 题目列表</title>
<link rel="stylesheet" href="https://cdn.staticfile.org/twitter-bootstrap/3.3.7/css/bootstrap.min.css">
<script src="https://cdn.staticfile.org/jquery/2.1.1/jquery.min.js"></script>
<script src="https://cdn.staticfile.org/twitter-bootstrap/3.3.7/js/bootstrap.min.js"></script>
</head>
<body>
<div style="width:80%;padding-top:50px;margin:auto">
<table class="table table-striped">
<caption>题目列表</caption>
<thead>
<tr>
<th>题号</th>
<th>标题</th>
<th>难度</th>
</tr>
</thead>
<tbody>
<tr>
<td><a href="./detail.html">CD1</a></td>
<td><a href="./detail.html">在行列都排好序的矩阵中找到指定的数</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD2</a></td>
<td><a href="./detail.html">最长的可整合子数组的长度</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD3</a></td>
<td><a href="./detail.html">不重复打印排序数组中相加和为给定值的所有二元组</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD4</a></td>
<td><a href="./detail.html">不重复打印排序数组中相加和为给定值的所有三元组</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD5</a></td>
<td><a href="./detail.html">设计getMin功能的栈</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD6</a></td>
<td><a href="./detail.html">由两个栈组成的队列</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD7</a></td>
<td><a href="./detail.html">用递归函数和栈逆序一个栈</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD8</a></td>
<td><a href="./detail.html">未排序正数数组中累加和为给定值的最长子数组的长度</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD9</a></td>
<td><a href="./detail.html">未排序数组中累加和为给定值的最长子数组长度</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD10</a></td>
<td><a href="./detail.html">未排序正数数组中累加和为给定值的最长子数组的长度</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD11</a></td>
<td><a href="./detail.html">未排序数组中累加和为给定值的最长子数组系列问题补2</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD12</a></td>
<td><a href="./detail.html">换钱的最少货币数</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD13</a></td>
<td><a href="./detail.html">用一个栈实现另一个栈的排序</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD14</a></td>
<td><a href="./detail.html">未排序数组中累加和小于或等于给定值的最长子数组长度</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD15</a></td>
<td><a href="./detail.html">生成窗口最大值数组</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD16</a></td>
<td><a href="./detail.html">求最大子矩阵的大小</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD17</a></td>
<td><a href="./detail.html">机器人达到指定位置方法数</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD18</a></td>
<td><a href="./detail.html">最大值减去最小值小于或等于num的子数组数量</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD19</a></td>
<td><a href="./detail.html">换钱的方法数</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD20</a></td>
<td><a href="./detail.html">打气球的最大分数</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD21</a></td>
<td><a href="./detail.html">计算数组的小和</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD22</a></td>
<td><a href="./detail.html">用栈来求解汉诺塔问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD23</a></td>
<td><a href="./detail.html">自然数数组的排序</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD24</a></td>
<td><a href="./detail.html">奇数下标都是奇数或者偶数下标都是偶数</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD25</a></td>
<td><a href="./detail.html">最长递增子序列</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD26</a></td>
<td><a href="./detail.html">子数组的最大累加和问题</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD27</a></td>
<td><a href="./detail.html">子矩阵的最大累加和问题</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD28</a></td>
<td><a href="./detail.html">在数组中找到一个局部最小的位置</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD29</a></td>
<td><a href="./detail.html">信封嵌套问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD30</a></td>
<td><a href="./detail.html">汉诺塔问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD31</a></td>
<td><a href="./detail.html">最长公共子序列</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD32</a></td>
<td><a href="./detail.html">数组中子数组的最大累乘积</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD33</a></td>
<td><a href="./detail.html">最长公共子串</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD34</a></td>
<td><a href="./detail.html">打印N个数组整体最大的TopK</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD35</a></td>
<td><a href="./detail.html">不包含本位置值的累乘数组 </a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD36</a></td>
<td><a href="./detail.html">数组的partition调整</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD37</a></td>
<td><a href="./detail.html">数组的partition调整补充问题</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD38</a></td>
<td><a href="./detail.html">求最短通路值</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD39</a></td>
<td><a href="./detail.html">数组中未出现的最小正整数</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD40</a></td>
<td><a href="./detail.html">数组排序之后相邻数的最大差值 </a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD41</a></td>
<td><a href="./detail.html">边界都是1的最大正方形大小</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD42</a></td>
<td><a href="./detail.html">子数组异或和为0的最多划分</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD43</a></td>
<td><a href="./detail.html">最小编辑代价</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD44</a></td>
<td><a href="./detail.html">字符串的交错组成</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD45</a></td>
<td><a href="./detail.html">龙与地下城游戏问题</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD46</a></td>
<td><a href="./detail.html">数字字符转化为字母组合的种数</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD47</a></td>
<td><a href="./detail.html">表达式得到期望结果的组合种数</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD48</a></td>
<td><a href="./detail.html">打印两个升序链表的公共部分</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD49</a></td>
<td><a href="./detail.html">在链表中删除倒数第K个节点</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD50</a></td>
<td><a href="./detail.html">做项目的最大收益问题</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
</tbody>
</table>
<div style="text-align: right;">
<ul class="pagination">
<li class="active"><a href="#">1</a></li>
<li><a href="#">2</a></li>
<li><a href="#">3</a></li>
<li><a href="#">4</a></li>
<li><a href="#">5</a></li>
</ul>
</div>
</div>
</body>
</html>
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>LeetCode题 - 题目列表</title>
<link rel="stylesheet" href="https://cdn.staticfile.org/twitter-bootstrap/3.3.7/css/bootstrap.min.css">
<script src="https://cdn.staticfile.org/jquery/2.1.1/jquery.min.js"></script>
<script src="https://cdn.staticfile.org/twitter-bootstrap/3.3.7/js/bootstrap.min.js"></script>
</head>
<body>
<div style="width:80%;padding-top:50px;margin:auto">
<table class="table table-striped">
<caption>题目列表</caption>
<thead>
<tr>
<th>题号</th>
<th>标题</th>
<th>难度</th>
</tr>
</thead>
<tbody>
<tr>
<td><a href="./detail.html">CD51</a></td>
<td><a href="./detail.html">分金条的最小花费</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD52</a></td>
<td><a href="./detail.html">大楼轮廓问题</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD53</a></td>
<td><a href="./detail.html">加油站良好出发点问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD54</a></td>
<td><a href="./detail.html">容器盛水问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD55</a></td>
<td><a href="./detail.html">一行代码求两个数的最大公约数</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD56</a></td>
<td><a href="./detail.html">有关阶乘的两个问题1</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD57</a></td>
<td><a href="./detail.html">有关阶乘的两个问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD58</a></td>
<td><a href="./detail.html">判断一个点是否在矩形内部</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD59</a></td>
<td><a href="./detail.html">判断一个点是否在三角形内部</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD60</a></td>
<td><a href="./detail.html">折纸问题</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD61</a></td>
<td><a href="./detail.html">能否完美地拼成矩形</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD62</a></td>
<td><a href="./detail.html">设计有setAll功能的哈希表</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD63</a></td>
<td><a href="./detail.html">最大的leftMax与rightMax之差的绝对值</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD64</a></td>
<td><a href="./detail.html">设计LRU缓存结构</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD65</a></td>
<td><a href="./detail.html">LFU缓存结构设计</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD66</a></td>
<td><a href="./detail.html">并查集的实现</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD67</a></td>
<td><a href="./detail.html">路径数组变为统计数组</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD68</a></td>
<td><a href="./detail.html">正数数组的最小不可组成和</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD69</a></td>
<td><a href="./detail.html">正数数组的最小不可组成和-进阶问题</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD70</a></td>
<td><a href="./detail.html">累加出整个范围所有的数最少还需要几个数</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD71</a></td>
<td><a href="./detail.html">一种字符串和数字的对应关系</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD72</a></td>
<td><a href="./detail.html">1到n中1的出现次数</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD73</a></td>
<td><a href="./detail.html">判断一个数是否是回文数</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD74</a></td>
<td><a href="./detail.html">在有序旋转数组中找到最小值</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD75</a></td>
<td><a href="./detail.html">在有序旋转数组中找到一个数</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD76</a></td>
<td><a href="./detail.html">数字的英文表达和中文表达</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD77</a></td>
<td><a href="./detail.html">分糖果问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD78</a></td>
<td><a href="./detail.html">分糖果问题进阶问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD79</a></td>
<td><a href="./detail.html">一种消息接收并打印的结构设计</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD80</a></td>
<td><a href="./detail.html">随时找到数据流的中位数</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD81</a></td>
<td><a href="./detail.html">在两个长度相等的排序数组中找到上中位数</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD82</a></td>
<td><a href="./detail.html">在两个排序数组中找到第k小的数</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD83</a></td>
<td><a href="./detail.html">两个有序数组间相加和的Topk问题</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD84</a></td>
<td><a href="./detail.html">出现次数的TopK问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD85</a></td>
<td><a href="./detail.html">Manacher算法 </a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD86</a></td>
<td><a href="./detail.html">Manacher算法进阶问题</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD87</a></td>
<td><a href="./detail.html">KMP算法</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD88</a></td>
<td><a href="./detail.html">丢棋子问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD89</a></td>
<td><a href="./detail.html">画匠问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD90</a></td>
<td><a href="./detail.html">邮局选址问题 </a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD91</a></td>
<td><a href="./detail.html">排成一条线的纸牌博弈问题</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD92</a></td>
<td><a href="./detail.html">跳跃游戏</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD93</a></td>
<td><a href="./detail.html">数组中的最长连续子序列</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD94</a></td>
<td><a href="./detail.html">N皇后问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD95</a></td>
<td><a href="./detail.html">判断两个字符串是否为变形词</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD96</a></td>
<td><a href="./detail.html">判断两个字符串是否互为旋转词</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD97</a></td>
<td><a href="./detail.html">将整数字符串转成整数值</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD98</a></td>
<td><a href="./detail.html">字符串的统计字符串</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD99</a></td>
<td><a href="./detail.html">在有序但是含有空的数组中查找字符串</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD100</a></td>
<td><a href="./detail.html">猫狗队列</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
</tbody>
</table>
<div style="text-align: right;">
<ul class="pagination">
<li class="active"><a href="#">1</a></li>
<li><a href="#">2</a></li>
<li><a href="#">3</a></li>
<li><a href="#">4</a></li>
<li><a href="#">5</a></li>
</ul>
</div>
</div>
</body>
</html>
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>LeetCode题 - 题目列表</title>
<link rel="stylesheet" href="https://cdn.staticfile.org/twitter-bootstrap/3.3.7/css/bootstrap.min.css">
<script src="https://cdn.staticfile.org/jquery/2.1.1/jquery.min.js"></script>
<script src="https://cdn.staticfile.org/twitter-bootstrap/3.3.7/js/bootstrap.min.js"></script>
</head>
<body>
<div style="width:80%;padding-top:50px;margin:auto">
<table class="table table-striped">
<caption>题目列表</caption>
<thead>
<tr>
<th>题号</th>
<th>标题</th>
<th>难度</th>
</tr>
</thead>
<tbody>
<tr>
<td><a href="./detail.html">CD101</a></td>
<td><a href="./detail.html">单调栈结构</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD102</a></td>
<td><a href="./detail.html">可见的山峰对数量</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD103</a></td>
<td><a href="./detail.html">判断数组中所有的数字是否只出现一次</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD104</a></td>
<td><a href="./detail.html">字符串的调整II</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD105</a></td>
<td><a href="./detail.html">可见的山峰对数量(进阶)</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD106</a></td>
<td><a href="./detail.html">删除链表的中间节点</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD107</a></td>
<td><a href="./detail.html">反转单向链表</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD108</a></td>
<td><a href="./detail.html">反转部分单向链表</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD109</a></td>
<td><a href="./detail.html">环形链表的约瑟夫问题</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD110</a></td>
<td><a href="./detail.html">环形链表的约瑟夫问题(进阶)</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD111</a></td>
<td><a href="./detail.html">判断一个链表是否为回文结构</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD112</a></td>
<td><a href="./detail.html">判断一个链表是否为回文结构(进阶)</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD113</a></td>
<td><a href="./detail.html">将单向链表按某值划分为左边小，中间相等，右边大的</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD114</a></td>
<td><a href="./detail.html">两个链表生成相加链表</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD115</a></td>
<td><a href="./detail.html">字符串的调整I</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD116</a></td>
<td><a href="./detail.html">翻转字符串（1）</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD117</a></td>
<td><a href="./detail.html">翻转字符串（2）</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD118</a></td>
<td><a href="./detail.html">完美洗牌问题（1）</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD119</a></td>
<td><a href="./detail.html">将单链表的每K个节点之间逆序</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD120</a></td>
<td><a href="./detail.html">完美洗牌问题（2）</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD121</a></td>
<td><a href="./detail.html">删除多余的字符得到字典序最小的字符串</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD122</a></td>
<td><a href="./detail.html">数组中两个字符串的最小距离</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD123</a></td>
<td><a href="./detail.html">字符串的转换路径问题</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD124</a></td>
<td><a href="./detail.html">添加最少的字符让字符串变为回文字符串（1）</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD125</a></td>
<td><a href="./detail.html">添加最少的字符让字符串变成回文串（2）</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD126</a></td>
<td><a href="./detail.html">括号字符串的有效性</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD127</a></td>
<td><a href="./detail.html">括号字符串的最长有效长度</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD128</a></td>
<td><a href="./detail.html">公式字符串求值</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD129</a></td>
<td><a href="./detail.html">0左边必有1的二进制字符串的数量</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD130</a></td>
<td><a href="./detail.html">拼接所有的字符串产生字典序最小的字符串</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD131</a></td>
<td><a href="./detail.html">找到字符串的最长无重复字符子串</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD132</a></td>
<td><a href="./detail.html">找到指定类型的新类型字符</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD133</a></td>
<td><a href="./detail.html">旋变字符串</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD134</a></td>
<td><a href="./detail.html">最短包含字符串的长度</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD135</a></td>
<td><a href="./detail.html">回文最少分割 </a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD136</a></td>
<td><a href="./detail.html">字符串匹配问题</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD137</a></td>
<td><a href="./detail.html">删除无序链表中值重复出现的节点</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD138</a></td>
<td><a href="./detail.html">在链表中删除指定值的节点</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD139</a></td>
<td><a href="./detail.html">单链表的选择排序</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD140</a></td>
<td><a href="./detail.html">字典树的实现 </a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD141</a></td>
<td><a href="./detail.html">子数组的最大异或和</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD142</a></td>
<td><a href="./detail.html">不用额外变量交换两个整数的值</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD143</a></td>
<td><a href="./detail.html">不用做任何比较判断运算符找出两个整数中的较大的值</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD144</a></td>
<td><a href="./detail.html">不用算术运算符实现整数的加减乘除运算</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD145</a></td>
<td><a href="./detail.html">整数的二进制数表达中有多少个1</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD146</a></td>
<td><a href="./detail.html">在其它数出现次数都为偶数的数组中找到出现次数为奇</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD147</a></td>
<td><a href="./detail.html">数组中值出现了一次的数字</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD148</a></td>
<td><a href="./detail.html">在其它数都出现k次的数组中找到只出现一次的数</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD149</a></td>
<td><a href="./detail.html">转圈打印矩阵</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD150</a></td>
<td><a href="./detail.html">将正方形矩阵顺时针旋转90度</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
</tbody>
</table>
<div style="text-align: right;">
<ul class="pagination">
<li class="active"><a href="#">1</a></li>
<li><a href="#">2</a></li>
<li><a href="#">3</a></li>
<li><a href="#">4</a></li>
<li><a href="#">5</a></li>
</ul>
</div>
</div>
</body>
</html>
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>LeetCode题 - 题目列表</title>
<link rel="stylesheet" href="https://cdn.staticfile.org/twitter-bootstrap/3.3.7/css/bootstrap.min.css">
<script src="https://cdn.staticfile.org/jquery/2.1.1/jquery.min.js"></script>
<script src="https://cdn.staticfile.org/twitter-bootstrap/3.3.7/js/bootstrap.min.js"></script>
</head>
<body>
<div style="width:80%;padding-top:50px;margin:auto">
<table class="table table-striped">
<caption>题目列表</caption>
<thead>
<tr>
<th>题号</th>
<th>标题</th>
<th>难度</th>
</tr>
</thead>
<tbody>
<tr>
<td><a href="./detail.html">CD151</a></td>
<td><a href="./detail.html">"之"字形打印矩阵</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD152</a></td>
<td><a href="./detail.html">找到无序数组中最小的k个数</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD153</a></td>
<td><a href="./detail.html">需要排序的最短子数组长度</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD154</a></td>
<td><a href="./detail.html">在数组中找到出现次数大于一半的数</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD155</a></td>
<td><a href="./detail.html">在数组中找到出现次数大于n/k的数</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD156</a></td>
<td><a href="./detail.html">将搜索二叉树转换成双向链表</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD157</a></td>
<td><a href="./detail.html">一种怪异的节点删除方式</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD158</a></td>
<td><a href="./detail.html">向有序的环形单链表中插入新节点</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD159</a></td>
<td><a href="./detail.html">合并两个有序的单链表</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD160</a></td>
<td><a href="./detail.html">按照左右半区的方式重新组合单链表</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD161</a></td>
<td><a href="./detail.html">实现二叉树先序，中序和后序遍历</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD162</a></td>
<td><a href="./detail.html">打印二叉树的边界节点</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD163</a></td>
<td><a href="./detail.html">二叉树的序列化</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD164</a></td>
<td><a href="./detail.html">遍历二叉树的神级方法</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD165</a></td>
<td><a href="./detail.html">在二叉树中找到累加和为指定值的最长路径长度</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD166</a></td>
<td><a href="./detail.html">找到二叉树中的最大搜索二叉子树</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD167</a></td>
<td><a href="./detail.html">找到二叉树中符合搜索二叉树条件的最大拓扑结构</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD168</a></td>
<td><a href="./detail.html">二叉树的按层打印与ZigZag打印</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD169</a></td>
<td><a href="./detail.html">找到搜索二叉树中两个错误的节点</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD170</a></td>
<td><a href="./detail.html">判断t1树是否包含t2树全部的拓扑结构</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD171</a></td>
<td><a href="./detail.html">判断t1树中是否有与t2树拓扑结构完全相同的子树</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD172</a></td>
<td><a href="./detail.html">判断二叉树是否为平衡二叉树</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD173</a></td>
<td><a href="./detail.html">根据后序数组重建搜索二叉树</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD174</a></td>
<td><a href="./detail.html">判断一棵二叉树是否为搜索二叉树和完全二叉树</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD175</a></td>
<td><a href="./detail.html">在二叉树中找到一个节点的后继节点</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD176</a></td>
<td><a href="./detail.html">在二叉树中找到两个节点的最近公共祖先</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD177</a></td>
<td><a href="./detail.html">在二叉树中找到两个节点的最近公共祖先(进阶)</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD178</a></td>
<td><a href="./detail.html">在二叉树中找到两个节点的最近公共祖先(再进阶)</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD179</a></td>
<td><a href="./detail.html">二叉树节点间的最大距离问题</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD180</a></td>
<td><a href="./detail.html">通过先序和中序数组生成后序数组</a></td>
<td><a href="./detail.html">入门</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD181</a></td>
<td><a href="./detail.html">统计和生成所有不同的二叉树</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD182</a></td>
<td><a href="./detail.html">统计和生成所有不同的二叉树(进阶)</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD183</a></td>
<td><a href="./detail.html">斐波那契数列问题的递归和动态规划</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD184</a></td>
<td><a href="./detail.html">斐波那契数列问题的递归和动态规划2</a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD185</a></td>
<td><a href="./detail.html">斐波那契数列问题的递归和动态规划3 </a></td>
<td><a href="./detail.html">较难</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD186</a></td>
<td><a href="./detail.html">矩阵的最小路径和</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD187</a></td>
<td><a href="./detail.html">派对的最大快乐值</a></td>
<td><a href="./detail.html">简单</a></td>
</tr>
<tr>
<td><a href="./detail.html">CD188</a></td>
<td><a href="./detail.html">单调栈结构(进阶)</a></td>
<td><a href="./detail.html">中等</a></td>
</tr>
</tbody>
</table>
<div style="text-align: right;">
<ul class="pagination">
<li class="active"><a href="#">1</a></li>
<li><a href="#">2</a></li>
<li><a href="#">3</a></li>
<li><a href="#">4</a></li>
<li><a href="#">5</a></li>
</ul>
</div>
</div>
</body>
</html>
扫一扫
435
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
