leetcode题库

悠悠 2023-06-04 02:43 22阅读 0赞

leetcode题库

\#题名题解通过率难度出现频率  1

[两数之和][Link 1]

46.5%简单2

[两数相加][Link 2]

35.5%中等3

[无重复字符的最长子串][Link 3]

31.1%中等4

[寻找两个有序数组的中位数][Link 4]

35.9%困难5

[最长回文子串][Link 5]

26.9%中等6

[Z 字形变换][Z]

44.5%中等7

[整数反转][Link 6]

33.0%简单8

[字符串转换整数 (atoi)][_atoi]

17.9%中等9

[回文数][Link 7]

56.5%简单10

[正则表达式匹配][Link 8]

24.6%困难11

[盛最多水的容器][Link 9]

57.3%中等12

[整数转罗马数字][Link 10]

60.7%中等13

[罗马数字转整数][Link 11]

58.9%简单14

[最长公共前缀][Link 12]

34.6%简单15

[三数之和][Link 13]

23.8%中等16

[最接近的三数之和][Link 14]

41.5%中等17

[电话号码的字母组合][Link 15]

50.8%中等18

[四数之和][Link 16]

36.0%中等19

[删除链表的倒数第N个节点][N]

35.3%中等20

[有效的括号][Link 17]

39.4%简单21

[合并两个有序链表][Link 18]

56.9%简单22

[括号生成][Link 19]

71.6%中等23

[合并K个排序链表][K]

47.4%困难24

[两两交换链表中的节点][Link 20]

61.9%中等25

[K 个一组翻转链表][K 1]

54.0%困难26

[删除排序数组中的重复项][Link 21]

46.0%简单27

[移除元素][Link 22]

55.8%简单28

[实现 strStr()][strStr]

38.8%简单29

[两数相除][Link 23]

18.6%中等30

[串联所有单词的子串][Link 24]

27.7%困难31

[下一个排列][Link 25]

31.8%中等32

[最长有效括号][Link 26]

28.1%困难33

[搜索旋转排序数组][Link 27]

36.1%中等34

[在排序数组中查找元素的第一个和最后一个位置][Link 28]

37.6%中等35

[搜索插入位置][Link 29]

44.2%简单36

[有效的数独][Link 30]

55.5%中等37

[解数独][Link 31]

56.0%困难38

[报数][Link 32]

52.3%简单39

[组合总和][Link 33]

66.6%中等40

[组合总和 II][II]

56.5%中等41

[缺失的第一个正数][Link 34]

36.2%困难42

[接雨水][Link 35]

46.1%困难43

[字符串相乘][Link 36]

40.3%中等44

[通配符匹配][Link 37]

24.8%困难45

[跳跃游戏 II][II 1]

31.3%困难46

[全排列][Link 38]

71.4%中等47

[全排列 II][II 2]

53.8%中等48

[旋转图像][Link 39]

63.8%中等49

[字母异位词分组][Link 40]

58.3%中等50

[Pow(x, n)][Pow_x_ n]

33.1%中等2050100全部[1][][2][][3][][4][][5][]

\#题名题解通过率难度出现频率  51

[N皇后][N 1]

64.8%困难52

[N皇后 II][N_ II]

75.2%困难53

[最大子序和][Link 41]

47.2%简单54

[螺旋矩阵][Link 42]

37.0%中等55

[跳跃游戏][Link 43]

36.0%中等56

[合并区间][Link 44]

38.1%中等57

[插入区间][Link 45]

35.1%困难58

[最后一个单词的长度][Link 46]

30.9%简单59

[螺旋矩阵 II][II 3]

74.4%中等60

[第k个排列][k]

46.9%中等61

[旋转链表][Link 47]

39.0%中等62

[不同路径][Link 48]

55.8%中等63

[不同路径 II][II 4]

31.6%中等64

[最小路径和][Link 49]

62.3%中等65

[有效数字][Link 50]

15.9%困难66

[加一][Link 51]

40.6%简单67

[二进制求和][Link 52]

50.3%简单68

[文本左右对齐][Link 53]

40.8%困难69

[x 的平方根][x]

36.8%简单70

[爬楼梯][Link 54]

46.6%简单71

[简化路径][Link 55]

37.3%中等72

[编辑距离][Link 56]

53.9%困难73

[矩阵置零][Link 57]

53.9%中等74

[搜索二维矩阵][Link 58]

35.9%中等75

[颜色分类][Link 59]

52.7%中等76

[最小覆盖子串][Link 60]

36.1%困难77

[组合][Link 61]

70.0%中等78

[子集][Link 62]

74.7%中等79

[单词搜索][Link 63]

38.8%中等80

[删除排序数组中的重复项 II][II 5]

51.7%中等81

[搜索旋转排序数组 II][II 6]

34.0%中等82

[删除排序链表中的重复元素 II][II 7]

43.3%中等83

[删除排序链表中的重复元素][Link 64]

47.5%简单84

[柱状图中最大的矩形][Link 65]

37.3%困难85

[最大矩形][Link 66]

42.9%困难86

[分隔链表][Link 67]

52.3%中等87

[扰乱字符串][Link 68]

43.3%困难88

[合并两个有序数组][Link 69]

45.2%简单89

[格雷编码][Link 70]

65.9%中等90

[子集 II][II 8]

56.8%中等91

[解码方法][Link 71]

21.6%中等92

[反转链表 II][II 9]

46.4%中等93

[复原IP地址][IP]

45.2%中等94

[二叉树的中序遍历][Link 72]

67.7%中等95

[不同的二叉搜索树 II][II 10]

58.8%中等96

[不同的二叉搜索树][Link 73]

62.0%中等97

[交错字符串][Link 74]

36.3%困难98

[验证二叉搜索树][Link 75]

27.4%中等99

[恢复二叉搜索树][Link 76]

54.7%困难100

[相同的树][Link 77]

54.6%简单2050100全部[1][][2][][3][][4][][5][]

\#题名题解通过率难度出现频率  101

[对称二叉树][Link 78]

48.2%简单102

[二叉树的层次遍历][Link 79]

58.4%中等103

[二叉树的锯齿形层次遍历][Link 80]

51.3%中等104

[二叉树的最大深度][Link 81]

70.7%简单105

[从前序与中序遍历序列构造二叉树][Link 82]

61.0%中等106

[从中序与后序遍历序列构造二叉树][Link 83]

64.0%中等107

[二叉树的层次遍历 II][II 11]

62.3%简单108

[将有序数组转换为二叉搜索树][Link 84]

66.3%简单109

[有序链表转换二叉搜索树][Link 85]

67.9%中等110

[平衡二叉树][Link 86]

49.1%简单111

[二叉树的最小深度][Link 87]

39.9%简单112

[路径总和][Link 88]

47.7%简单113

[路径总和 II][II 12]

56.9%中等114

[二叉树展开为链表][Link 89]

64.5%中等115

[不同的子序列][Link 90]

44.4%困难116

[填充每个节点的下一个右侧节点指针][Link 91]

45.8%中等117

[填充每个节点的下一个右侧节点指针 II][II 13]

40.4%中等118

[杨辉三角][Link 92]

63.7%简单119

[杨辉三角 II][II 14]

57.5%简单120

[三角形最小路径和][Link 93]

61.4%中等121

[买卖股票的最佳时机][Link 94]

50.6%简单122

[买卖股票的最佳时机 II][II 15]

55.2%简单123

[买卖股票的最佳时机 III][III]

39.2%困难124

[二叉树中的最大路径和][Link 95]

37.5%困难125

[验证回文串][Link 96]

40.8%简单126

[单词接龙 II][II 16]

27.8%困难127

[单词接龙][Link 97]

36.7%中等128

[最长连续序列][Link 98]

46.6%困难129

[求根到叶子节点数字之和][Link 99]

58.8%中等130

[被围绕的区域][Link 100]

37.9%中等131

[分割回文串][Link 101]

63.5%中等132

[分割回文串 II][II 17]

40.1%困难133

[克隆图][Link 102]

39.0%中等134

[加油站][Link 103]

48.6%中等135

[分发糖果][Link 104]

41.6%困难136

[只出现一次的数字][Link 105]

63.1%简单137

[只出现一次的数字 II][II 18]

64.3%中等138

[复制带随机指针的链表][Link 106]

36.0%中等139

[单词拆分][Link 107]

42.7%中等140

[单词拆分 II][II 19]

37.4%困难141

[环形链表][Link 108]

42.6%简单142

[环形链表 II][II 20]

43.3%中等143

[重排链表][Link 109]

51.2%中等144

[二叉树的前序遍历][Link 110]

61.5%中等145

[二叉树的后序遍历][Link 111]

67.2%困难146

[LRU缓存机制][LRU]

43.3%中等147

[对链表进行插入排序][Link 112]

59.8%中等148

[排序链表][Link 113]

61.7%中等149

[直线上最多的点数][Link 114]

18.1%困难150

[逆波兰表达式求值][Link 115]

45.8%中等2050100全部[1][][2][][3][][4][][5][]

<table> 
 <tbody> 
  <tr> 
   <td>151</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/reverse-words-in-a-string" rel="nofollow">翻转字符串里的单词</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>29.9%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>152</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/maximum-product-subarray" rel="nofollow">乘积最大子序列</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>35.2%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>153</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array" rel="nofollow">寻找旋转排序数组中的最小值</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>49.5%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>154</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii" rel="nofollow">寻找旋转排序数组中的最小值 II</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>44.8%</td> 
   <td><span>困难</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>155</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/min-stack" rel="nofollow">最小栈</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>49.7%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>156</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/binary-tree-upside-down" rel="nofollow">上下翻转二叉树</a>&nbsp; 
     <span>&nbsp;<span>&nbsp;&nbsp;</span></span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>73.5%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>157</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/read-n-characters-given-read4" rel="nofollow">用 Read4 读取 N 个字符</a>&nbsp; 
     <span>&nbsp;<span>&nbsp;&nbsp;</span></span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>53.8%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>158</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/read-n-characters-given-read4-ii-call-multiple-times" rel="nofollow">用 Read4 读取 N 个字符 II</a>&nbsp; 
     <span>&nbsp;<span>&nbsp;&nbsp;</span></span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>53.7%</td> 
   <td><span>困难</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>159</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/longest-substring-with-at-most-two-distinct-characters" rel="nofollow">至多包含两个不同字符的最长子串</a>&nbsp; 
     <span>&nbsp;<span>&nbsp;&nbsp;</span></span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>51.1%</td> 
   <td><span>困难</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>160</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/intersection-of-two-linked-lists" rel="nofollow">相交链表</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>47.6%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>161</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/one-edit-distance" rel="nofollow">相隔为 1 的编辑距离</a>&nbsp; 
     <span>&nbsp;<span>&nbsp;&nbsp;</span></span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>33.8%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>162</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/find-peak-element" rel="nofollow">寻找峰值</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>41.7%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>163</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/missing-ranges" rel="nofollow">缺失的区间</a>&nbsp; 
     <span>&nbsp;<span>&nbsp;&nbsp;</span></span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>26.8%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>164</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/maximum-gap" rel="nofollow">最大间距</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>51.5%</td> 
   <td><span>困难</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>165</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/compare-version-numbers" rel="nofollow">比较版本号</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>33.3%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>166</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/fraction-to-recurring-decimal" rel="nofollow">分数到小数</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>24.5%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>167</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted" rel="nofollow">两数之和 II - 输入有序数组</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>49.8%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>168</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/excel-sheet-column-title" rel="nofollow">Excel表列名称</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>34.6%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>169</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/majority-element" rel="nofollow">求众数</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>60.3%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>170</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/two-sum-iii-data-structure-design" rel="nofollow">两数之和 III - 数据结构设计</a>&nbsp; 
     <span>&nbsp;<span>&nbsp;&nbsp;</span></span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>39.5%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>171</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/excel-sheet-column-number" rel="nofollow">Excel表列序号</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>65.0%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>172</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/factorial-trailing-zeroes" rel="nofollow">阶乘后的零</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>39.4%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>173</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/binary-search-tree-iterator" rel="nofollow">二叉搜索树迭代器</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>66.6%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>174</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/dungeon-game" rel="nofollow">地下城游戏</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>38.1%</td> 
   <td><span>困难</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>175</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/combine-two-tables" rel="nofollow">组合两个表</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>69.7%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>176</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/second-highest-salary" rel="nofollow">第二高的薪水</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>32.3%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>177</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/nth-highest-salary" rel="nofollow">第N高的薪水</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>41.7%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>178</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/rank-scores" rel="nofollow">分数排名</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>56.8%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>179</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/largest-number" rel="nofollow">最大数</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>33.3%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>180</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/consecutive-numbers" rel="nofollow">连续出现的数字</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>46.6%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>181</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/employees-earning-more-than-their-managers" rel="nofollow">超过经理收入的员工</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>66.1%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>182</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/duplicate-emails" rel="nofollow">查找重复的电子邮箱</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>76.2%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>183</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/customers-who-never-order" rel="nofollow">从不订购的客户</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>62.7%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>184</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/department-highest-salary" rel="nofollow">部门工资最高的员工</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>40.5%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>185</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/department-top-three-salaries" rel="nofollow">部门工资前三高的所有员工</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>37.7%</td> 
   <td><span>困难</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>186</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/reverse-words-in-a-string-ii" rel="nofollow">翻转字符串里的单词 II</a>&nbsp; 
     <span>&nbsp;<span>&nbsp;&nbsp;</span></span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>68.1%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>187</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/repeated-dna-sequences" rel="nofollow">重复的DNA序列</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>43.4%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>188</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv" rel="nofollow">买卖股票的最佳时机 IV</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>27.9%</td> 
   <td><span>困难</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>189</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/rotate-array" rel="nofollow">旋转数组</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>38.5%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>190</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/reverse-bits" rel="nofollow">颠倒二进制位</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>46.9%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>191</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/number-of-1-bits" rel="nofollow">位1的个数</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>58.1%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>192</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/word-frequency" rel="nofollow">统计词频</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>31.9%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>193</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/valid-phone-numbers" rel="nofollow">有效电话号码</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>25.5%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>194</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/transpose-file" rel="nofollow">转置文件</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>33.0%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>195</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/tenth-line" rel="nofollow">第十行</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>41.5%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>196</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/delete-duplicate-emails" rel="nofollow">删除重复的电子邮箱</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>55.7%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>197</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/rising-temperature" rel="nofollow">上升的温度</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>46.3%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>198</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/house-robber" rel="nofollow">打家劫舍</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>41.4%</td> 
   <td><span>简单</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>199</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/binary-tree-right-side-view" rel="nofollow">二叉树的右视图</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>60.6%</td> 
   <td><span>中等</span></td> 
   <td>&nbsp;</td> 
  </tr> 
  <tr> 
   <td>&nbsp;</td> 
   <td>200</td> 
   <td> 
    <div> 
     <a href="https://leetcode-cn.com/problems/number-of-islands" rel="nofollow">岛屿数量</a>&nbsp; 
     <span>&nbsp;&nbsp;&nbsp;</span> 
    </div> </td> 
   <td>&nbsp;</td> 
   <td>45.4%</td> 
   <td><span>中等<br><br></span></td> 
  </tr> 
 </tbody> 
</table>

转载于:https://www.cnblogs.com/think90/p/11440107.html

[Link 1]: https://leetcode-cn.com/problems/two-sum
[Link 2]: https://leetcode-cn.com/problems/add-two-numbers
[Link 3]: https://leetcode-cn.com/problems/longest-substring-without-repeating-characters
[Link 4]: https://leetcode-cn.com/problems/median-of-two-sorted-arrays
[Link 5]: https://leetcode-cn.com/problems/longest-palindromic-substring
[Z]: https://leetcode-cn.com/problems/zigzag-conversion
[Link 6]: https://leetcode-cn.com/problems/reverse-integer
[_atoi]: https://leetcode-cn.com/problems/string-to-integer-atoi
[Link 7]: https://leetcode-cn.com/problems/palindrome-number
[Link 8]: https://leetcode-cn.com/problems/regular-expression-matching
[Link 9]: https://leetcode-cn.com/problems/container-with-most-water
[Link 10]: https://leetcode-cn.com/problems/integer-to-roman
[Link 11]: https://leetcode-cn.com/problems/roman-to-integer
[Link 12]: https://leetcode-cn.com/problems/longest-common-prefix
[Link 13]: https://leetcode-cn.com/problems/3sum
[Link 14]: https://leetcode-cn.com/problems/3sum-closest
[Link 15]: https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number
[Link 16]: https://leetcode-cn.com/problems/4sum
[N]: https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list
[Link 17]: https://leetcode-cn.com/problems/valid-parentheses
[Link 18]: https://leetcode-cn.com/problems/merge-two-sorted-lists
[Link 19]: https://leetcode-cn.com/problems/generate-parentheses
[K]: https://leetcode-cn.com/problems/merge-k-sorted-lists
[Link 20]: https://leetcode-cn.com/problems/swap-nodes-in-pairs
[K 1]: https://leetcode-cn.com/problems/reverse-nodes-in-k-group
[Link 21]: https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array
[Link 22]: https://leetcode-cn.com/problems/remove-element
[strStr]: https://leetcode-cn.com/problems/implement-strstr
[Link 23]: https://leetcode-cn.com/problems/divide-two-integers
[Link 24]: https://leetcode-cn.com/problems/substring-with-concatenation-of-all-words
[Link 25]: https://leetcode-cn.com/problems/next-permutation
[Link 26]: https://leetcode-cn.com/problems/longest-valid-parentheses
[Link 27]: https://leetcode-cn.com/problems/search-in-rotated-sorted-array
[Link 28]: https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array
[Link 29]: https://leetcode-cn.com/problems/search-insert-position
[Link 30]: https://leetcode-cn.com/problems/valid-sudoku
[Link 31]: https://leetcode-cn.com/problems/sudoku-solver
[Link 32]: https://leetcode-cn.com/problems/count-and-say
[Link 33]: https://leetcode-cn.com/problems/combination-sum
[II]: https://leetcode-cn.com/problems/combination-sum-ii
[Link 34]: https://leetcode-cn.com/problems/first-missing-positive
[Link 35]: https://leetcode-cn.com/problems/trapping-rain-water
[Link 36]: https://leetcode-cn.com/problems/multiply-strings
[Link 37]: https://leetcode-cn.com/problems/wildcard-matching
[II 1]: https://leetcode-cn.com/problems/jump-game-ii
[Link 38]: https://leetcode-cn.com/problems/permutations
[II 2]: https://leetcode-cn.com/problems/permutations-ii
[Link 39]: https://leetcode-cn.com/problems/rotate-image
[Link 40]: https://leetcode-cn.com/problems/group-anagrams
[Pow_x_ n]: https://leetcode-cn.com/problems/powx-n
[1]: https://leetcode-cn.com/problemset/all/#page-1
[2]: https://leetcode-cn.com/problemset/all/#page-2
[3]: https://leetcode-cn.com/problemset/all/#page-3
[4]: https://leetcode-cn.com/problemset/all/#page-4
[5]: https://leetcode-cn.com/problemset/all/#page-5
[N 1]: https://leetcode-cn.com/problems/n-queens
[N_ II]: https://leetcode-cn.com/problems/n-queens-ii
[Link 41]: https://leetcode-cn.com/problems/maximum-subarray
[Link 42]: https://leetcode-cn.com/problems/spiral-matrix
[Link 43]: https://leetcode-cn.com/problems/jump-game
[Link 44]: https://leetcode-cn.com/problems/merge-intervals
[Link 45]: https://leetcode-cn.com/problems/insert-interval
[Link 46]: https://leetcode-cn.com/problems/length-of-last-word
[II 3]: https://leetcode-cn.com/problems/spiral-matrix-ii
[k]: https://leetcode-cn.com/problems/permutation-sequence
[Link 47]: https://leetcode-cn.com/problems/rotate-list
[Link 48]: https://leetcode-cn.com/problems/unique-paths
[II 4]: https://leetcode-cn.com/problems/unique-paths-ii
[Link 49]: https://leetcode-cn.com/problems/minimum-path-sum
[Link 50]: https://leetcode-cn.com/problems/valid-number
[Link 51]: https://leetcode-cn.com/problems/plus-one
[Link 52]: https://leetcode-cn.com/problems/add-binary
[Link 53]: https://leetcode-cn.com/problems/text-justification
[x]: https://leetcode-cn.com/problems/sqrtx
[Link 54]: https://leetcode-cn.com/problems/climbing-stairs
[Link 55]: https://leetcode-cn.com/problems/simplify-path
[Link 56]: https://leetcode-cn.com/problems/edit-distance
[Link 57]: https://leetcode-cn.com/problems/set-matrix-zeroes
[Link 58]: https://leetcode-cn.com/problems/search-a-2d-matrix
[Link 59]: https://leetcode-cn.com/problems/sort-colors
[Link 60]: https://leetcode-cn.com/problems/minimum-window-substring
[Link 61]: https://leetcode-cn.com/problems/combinations
[Link 62]: https://leetcode-cn.com/problems/subsets
[Link 63]: https://leetcode-cn.com/problems/word-search
[II 5]: https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii
[II 6]: https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii
[II 7]: https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii
[Link 64]: https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list
[Link 65]: https://leetcode-cn.com/problems/largest-rectangle-in-histogram
[Link 66]: https://leetcode-cn.com/problems/maximal-rectangle
[Link 67]: https://leetcode-cn.com/problems/partition-list
[Link 68]: https://leetcode-cn.com/problems/scramble-string
[Link 69]: https://leetcode-cn.com/problems/merge-sorted-array
[Link 70]: https://leetcode-cn.com/problems/gray-code
[II 8]: https://leetcode-cn.com/problems/subsets-ii
[Link 71]: https://leetcode-cn.com/problems/decode-ways
[II 9]: https://leetcode-cn.com/problems/reverse-linked-list-ii
[IP]: https://leetcode-cn.com/problems/restore-ip-addresses
[Link 72]: https://leetcode-cn.com/problems/binary-tree-inorder-traversal
[II 10]: https://leetcode-cn.com/problems/unique-binary-search-trees-ii
[Link 73]: https://leetcode-cn.com/problems/unique-binary-search-trees
[Link 74]: https://leetcode-cn.com/problems/interleaving-string
[Link 75]: https://leetcode-cn.com/problems/validate-binary-search-tree
[Link 76]: https://leetcode-cn.com/problems/recover-binary-search-tree
[Link 77]: https://leetcode-cn.com/problems/same-tree
[Link 78]: https://leetcode-cn.com/problems/symmetric-tree
[Link 79]: https://leetcode-cn.com/problems/binary-tree-level-order-traversal
[Link 80]: https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal
[Link 81]: https://leetcode-cn.com/problems/maximum-depth-of-binary-tree
[Link 82]: https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
[Link 83]: https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal
[II 11]: https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii
[Link 84]: https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree
[Link 85]: https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree
[Link 86]: https://leetcode-cn.com/problems/balanced-binary-tree
[Link 87]: https://leetcode-cn.com/problems/minimum-depth-of-binary-tree
[Link 88]: https://leetcode-cn.com/problems/path-sum
[II 12]: https://leetcode-cn.com/problems/path-sum-ii
[Link 89]: https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list
[Link 90]: https://leetcode-cn.com/problems/distinct-subsequences
[Link 91]: https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node
[II 13]: https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii
[Link 92]: https://leetcode-cn.com/problems/pascals-triangle
[II 14]: https://leetcode-cn.com/problems/pascals-triangle-ii
[Link 93]: https://leetcode-cn.com/problems/triangle
[Link 94]: https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock
[II 15]: https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii
[III]: https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii
[Link 95]: https://leetcode-cn.com/problems/binary-tree-maximum-path-sum
[Link 96]: https://leetcode-cn.com/problems/valid-palindrome
[II 16]: https://leetcode-cn.com/problems/word-ladder-ii
[Link 97]: https://leetcode-cn.com/problems/word-ladder
[Link 98]: https://leetcode-cn.com/problems/longest-consecutive-sequence
[Link 99]: https://leetcode-cn.com/problems/sum-root-to-leaf-numbers
[Link 100]: https://leetcode-cn.com/problems/surrounded-regions
[Link 101]: https://leetcode-cn.com/problems/palindrome-partitioning
[II 17]: https://leetcode-cn.com/problems/palindrome-partitioning-ii
[Link 102]: https://leetcode-cn.com/problems/clone-graph
[Link 103]: https://leetcode-cn.com/problems/gas-station
[Link 104]: https://leetcode-cn.com/problems/candy
[Link 105]: https://leetcode-cn.com/problems/single-number
[II 18]: https://leetcode-cn.com/problems/single-number-ii
[Link 106]: https://leetcode-cn.com/problems/copy-list-with-random-pointer
[Link 107]: https://leetcode-cn.com/problems/word-break
[II 19]: https://leetcode-cn.com/problems/word-break-ii
[Link 108]: https://leetcode-cn.com/problems/linked-list-cycle
[II 20]: https://leetcode-cn.com/problems/linked-list-cycle-ii
[Link 109]: https://leetcode-cn.com/problems/reorder-list
[Link 110]: https://leetcode-cn.com/problems/binary-tree-preorder-traversal
[Link 111]: https://leetcode-cn.com/problems/binary-tree-postorder-traversal
[LRU]: https://leetcode-cn.com/problems/lru-cache
[Link 112]: https://leetcode-cn.com/problems/insertion-sort-list
[Link 113]: https://leetcode-cn.com/problems/sort-list
[Link 114]: https://leetcode-cn.com/problems/max-points-on-a-line
[Link 115]: https://leetcode-cn.com/problems/evaluate-reverse-polish-notation