# Title Solution Acceptance Difficulty Frequency  
  4   27.2% Hard  
  10   25.6% Hard  
  23   35.8% Hard  
  25   37.7% Hard  
  30   24.1% Hard  
  32   26.2% Hard  
  37   38.5% Hard  
  41   29.6% Hard  
  42   44.4% Hard  
  44   23.3% Hard  
  45
Jump Game II    
  28.7% Hard  
  51
N-Queens    
  41.1% Hard  
  52
N-Queens II    
  53.4% Hard  
  57   31.7% Hard  
  65
Valid Number    
  14.3% Hard  
  68   24.2% Hard  
  72   39.1% Hard  
  76   31.7% Hard  
  84   32.1% Hard  
  85   34.4% Hard  
  87   32.1% Hard  
  97   28.7% Hard  
  99   35.5% Hard  
  115   35.7% Hard  
  123   34.6% Hard  
  124   30.8% Hard  
  126   18.7% Hard  
  128   42.5% Hard  
  132   28.2% Hard  
  135
Candy    
  29.1% Hard  
  140   28.1% Hard  
  145   49.9% Hard  
  149   16.0% Hard  
  154   39.7% Hard  
  158   27.6% Hard  
  159   47.7% Hard  
  164
Maximum Gap    
  33.2% Hard  
  174
Dungeon Game    
  27.8% Hard  
  185   27.8% Hard  
  188   26.8% Hard  
  212   29.8% Hard  
  214   28.1% Hard  
  218   32.3% Hard  
  224   33.7% Hard  
  233   30.6% Hard  
  239   39.1% Hard  
  248   37.3% Hard  
  262   26.4% Hard  
  265   42.2% Hard  
  269   32.0% Hard  
  272   46.3% Hard  
  273   24.8% Hard  
  282   33.4% Hard  
  291   41.6% Hard  
  295   38.2% Hard  
  296   55.8% Hard  
  297   42.3% Hard  
  301   40.1% Hard  
  302   49.8% Hard  
  305   41.3% Hard  
  308   32.9% Hard  
  312   48.3% Hard  
  315   39.0% Hard  
  316   33.3% Hard  
  317   38.8% Hard  
  321   25.8% Hard  
  327   33.4% Hard  
  329   40.8% Hard  
  330   33.6% Hard  
  335   27.2% Hard  
  336   31.7% Hard  
  340   40.8% Hard  
  352   44.2% Hard  
  354   34.3% Hard  
  358   33.4% Hard  
  363   35.6% Hard  
  381   32.5% Hard  
  391   28.6% Hard  
  403
Frog Jump    
  36.9% Hard  
  407   39.9% Hard  
  410   42.8% Hard  
  411   35.2% Hard  
  420   16.6% Hard  
  425
Word Squares    
  45.2% Hard  
  428   55.2% Hard  
  431   65.0% Hard  
  432   30.3% Hard  
  440   27.0% Hard  
  446   30.9% Hard  
  458
Poor Pigs    
  46.1% Hard  
  460
LFU Cache    
  29.7% Hard  
  465   43.6% Hard  
  466   27.4% Hard  
  471   45.6% Hard  
  472   36.4% Hard  
  479   27.8% Hard  
  480   33.6% Hard  
  483   34.3% Hard  
  488
Zuma Game    
  39.7% Hard  
  489   65.8% Hard  
  493   23.5% Hard  
  499
The Maze III    
  38.0% Hard  
  502
IPO    
  38.4% Hard  
  514   41.0% Hard  
  517   37.0% Hard  
  527   51.2% Hard  
  546
Remove Boxes    
  38.9% Hard  
  552   33.8% Hard  
  564   19.0% Hard  
  568   38.5% Hard  
  569   49.6% Hard  
  571   46.5% Hard  
  579   34.7% Hard  
  587   34.6% Hard  
  588   41.3% Hard  
  591   33.2% Hard  
  600   33.1% Hard  
  601   37.3% Hard  
  615   39.2% Hard  
  618   44.3% Hard  
  629   29.6% Hard  
  630   32.4% Hard  
  631   29.5% Hard  
  632   48.8% Hard  
  639   25.5% Hard  
  642   39.3% Hard  
  644   29.5% Hard  
  656
Coin Path    
  27.5% Hard  
  660
Remove 9    
  52.4% Hard  
  664   37.3% Hard  
  668   42.8% Hard  
  675   31.6% Hard  
  679
24 Game    
  43.6% Hard  
  683   34.5% Hard  
  685   31.1% Hard  
  689   44.3% Hard  
  691   39.1% Hard  
  699   40.5% Hard  
  710   32.0% Hard  
  711   47.0% Hard  
  715
Range Module    
  36.2% Hard  
  719   29.8% Hard  
  726   45.5% Hard  
  727   38.2% Hard  
  730   39.7% Hard  
  732   56.6% Hard  
  736   45.1% Hard  
  741   30.7% Hard  
  745   31.5% Hard  
  749   41.5% Hard  
  753   47.6% Hard  
  757   36.9% Hard  
  759   62.4% Hard  
  761   52.4% Hard  
  765   52.1% Hard  
  768   46.6% Hard  
  770   45.5% Hard  
  772   41.9% Hard  
  773   53.9% Hard  
  774   43.0% Hard  
  778   48.7% Hard  
  780   27.7% Hard  
  782   39.5% Hard  
  786   40.5% Hard  
  793   39.2% Hard  
  798   41.1% Hard  
  803   29.1% Hard  
  805   24.8% Hard  
  810   45.0% Hard  
  815
Bus Routes    
  40.6% Hard  
  818
Race Car    
  36.0% Hard  
  827   43.6% Hard  
  828   41.0% Hard  
  829   34.1% Hard  
  834   40.6% Hard  
  839   35.4% Hard  
  843   44.5% Hard  
  847   48.0% Hard  
  850   45.4% Hard  
  854   34.7% Hard  
  857   48.2% Hard  
  862   22.6% Hard  
  864   37.3% Hard  
  871   29.9% Hard  
  878   25.9% Hard  
  879   37.3% Hard  
  882   38.7% Hard  
  887   25.1% Hard  
  891   29.7% Hard  
  895   57.1% Hard  
  899   48.1% Hard  
  902   29.0% Hard  
  903   45.4% Hard  
  906   30.6% Hard  
  913   29.1% Hard  
  920   43.9% Hard  
  924   40.7% Hard  
  927   30.8% Hard  
  928   39.4% Hard  
  936   35.5% Hard  
  940   40.3% Hard  
  943   39.1% Hard  
  952   26.9% Hard  
  956   38.5% Hard  
  960   52.8% Hard  
  964   40.6% Hard  
  968   35.8% Hard  
  972   39.9% Hard  
  975   46.0% Hard  
  980   71.3% Hard  
  982   54.5% Hard  
  992   45.1% Hard  
  995   47.6% Hard  
  996   47.7% Hard  
  1000   34.8% Hard  
  1001   34.8% Hard  
  1012   34.9% Hard  
  1028   69.4% Hard  
  1032   42.9% Hard  
  1036   35.0% Hard  
  1044   22.9% Hard  
  1063   72.8% Hard  
  1067   37.9% Hard  
  1074   57.9% Hard  
  1088   36.1% Hard  
  1092   48.3% Hard  
  1095   34.3% Hard  
  1096   56.7% Hard  
  1097   47.0% Hard  
  1106   57.7% Hard  
  1121   53.6% Hard  
  1125   44.5% Hard  
  1127   45.4% Hard  
  1136   60.1% Hard  
  1147   57.8% Hard  
  1153   28.7% Hard  
  1157   32.3% Hard  
  1159   48.8% Hard  
  1163   29.9% Hard  
  1168   48.9% Hard  
  1172   42.1% Hard  
  1178   23.7% Hard

leetcode hard的更多相关文章

  1. 我为什么要写LeetCode的博客?

    # 增强学习成果 有一个研究成果,在学习中传授他人知识和讨论是最高效的做法,而看书则是最低效的做法(具体研究成果没找到地址).我写LeetCode博客主要目的是增强学习成果.当然,我也想出名,然而不知 ...

  2. LeetCode All in One 题目讲解汇总(持续更新中...)

    终于将LeetCode的免费题刷完了,真是漫长的第一遍啊,估计很多题都忘的差不多了,这次开个题目汇总贴,并附上每道题目的解题连接,方便之后查阅吧~ 477 Total Hamming Distance ...

  3. [LeetCode] Longest Substring with At Least K Repeating Characters 至少有K个重复字符的最长子字符串

    Find the length of the longest substring T of a given string (consists of lowercase letters only) su ...

  4. Leetcode 笔记 113 - Path Sum II

    题目链接:Path Sum II | LeetCode OJ Given a binary tree and a sum, find all root-to-leaf paths where each ...

  5. Leetcode 笔记 112 - Path Sum

    题目链接:Path Sum | LeetCode OJ Given a binary tree and a sum, determine if the tree has a root-to-leaf ...

  6. Leetcode 笔记 110 - Balanced Binary Tree

    题目链接:Balanced Binary Tree | LeetCode OJ Given a binary tree, determine if it is height-balanced. For ...

  7. Leetcode 笔记 100 - Same Tree

    题目链接:Same Tree | LeetCode OJ Given two binary trees, write a function to check if they are equal or ...

  8. Leetcode 笔记 99 - Recover Binary Search Tree

    题目链接:Recover Binary Search Tree | LeetCode OJ Two elements of a binary search tree (BST) are swapped ...

  9. Leetcode 笔记 98 - Validate Binary Search Tree

    题目链接:Validate Binary Search Tree | LeetCode OJ Given a binary tree, determine if it is a valid binar ...

  10. Leetcode 笔记 101 - Symmetric Tree

    题目链接:Symmetric Tree | LeetCode OJ Given a binary tree, check whether it is a mirror of itself (ie, s ...

随机推荐

  1. ant DatePicker 中文

    方式一:局部设置 import 'moment/locale/zh-cn'; import locale from 'antd/lib/date-picker/locale/zh_CN'; //调用时 ...

  2. 学习前端第一天心得体会(初步了解HTML5的新特性以及和HTML的区别)

    一.HTML5是什么? HTML5 是最新的 HTML 标准. HTML5 是专门为承载丰富的 web 内容而设计的,并且无需额外插件. HTML5 拥有新的语义.图形以及多媒体元素. HTML5 提 ...

  3. 阶段3 3.SpringMVC·_06.异常处理及拦截器_5 SpringMVC拦截器之编写controller

    先新建包,com.itcast.controller,然后把异常拦截的项目的UserController复制过来. 复制过来稍作修改 创建pages文件件,然后新建success.jsp页面 部署当前 ...

  4. 阶段3 3.SpringMVC·_03.SpringMVC常用注解_3 PathVariable注解

    请求地址都一样,根据不同的请求方式,最终让不同的方法去执行.这就是restfull的风格 如果有两个查询都是get的.那么当前访问 满足条件的就是两个. 用一个占位符 {id} 演示PathVaria ...

  5. 六十一:Flask.Session之flask操作session

    1.设置session:使用flask.session就可以操作字典,操作方式和操作字典一样:session['key']=value2.获取session,和获取字典的值一样:session['ke ...

  6. SQL学习(五)多表关联-join

    在实际工作中会用到多表联查,此时需要用到关键字JOIN 一.inner join(内连接) 至少有一个匹配时返回行,只返回两个表中连接字段相等的行 如: select * from ticket in ...

  7. debain安装文泉驿字体

    sudo apt-get install ttf-wqy-microhei sudo apt-get install ttf-wqy-zenhei

  8. shell脚本安装python、pip--这种写法是错误的---每一个命令执行完都要判断是否执行成功,否则无法进行下一步

    shell脚本安装python.pip--不需要选择安装项目--不管用总报错,必须带上判断符号,while没有这种用法,写在这里为了以后少走弯路,所以不要用下面的执行了 首先把pip-.tgz 安装包 ...

  9. python爬虫前提技术

    1.BeautifulSoup 解析html如何使用 转自:http://blog.csdn.net/u013372487/article/details/51734047 #!/usr/bin/py ...

  10. 【Linux】【一】linux 目录切换、创建目录和文件、编辑目录以及文件(txt)

    以下 是在指定目录下创建文件夹目录,以及在该目录下创建txt文件进行编辑,保存. 然后删除相关文件以及目录的命令操作记录. 本操作记录中的命令简单解释: pwd 显示当前路径 ls 显示当前目录下的文 ...