LeetCode Questions List (LeetCode 问题列表)- Java Solutions
因为在开始写这个博客之前,已经刷了100题了,所以现在还是有很多题目没有加进来,为了方便查找哪些没加进来,先列一个表可以比较清楚的查看,也方便给大家查找。如果有哪些题目的链接有错误,请大家留言和谅解,链多了会眼花。
| # | Title | Category | Difficulty |
| 697 | Degree of an Array | Algorithms | Easy |
| 695 | Max Area of Island | Algorithms | Easy |
| 674 | Longest Continuous Increasing Subsequence | Algorithms | Easy |
| 665 | Non-decreasing Array | Algorithms | Easy |
| 661 | Image Smoother | Algorithms | Easy |
| 643 | Maximum Average Subarray I | Algorithms | Easy |
| 628 | Maximum Product of Three Numbers | Algorithms | Easy |
| 624 | Maximum Distance in Arrays $ | Algorithms | Easy |
| 617 | Merge Two Binary Trees | Algorithms | Easy |
| 606 | Construct String from Binary Tree | Algorithms | Easy |
| 605 | Can Place Flowers | Algorithms | Easy |
| 604 | Design Compressed String Iterator $ | Algorithms | Easy |
| 599 | Minimum Index Sum of Two Lists | Algorithms | Easy |
| 598 | Range Addition II | Algorithms | Easy |
| 594 | Longest Harmonious Subsequence | Algorithms | Easy |
| 581 | Shortest Unsorted Continuous Subarray | Algorithms | Easy |
| 575 | Distribute Candies | Algorithms | Easy |
| 572 | Subtree of Another Tree | Algorithms | Easy |
| 566 | Reshape the Matrix | Algorithms | Easy |
| 563 | Binary Tree Tilt | Algorithms | Easy |
| 562 | Longest Line of Consecutive One in Matrix $ | Algorithms | Medium |
| 561 | Array Partition I | Algorithms | Easy |
| 560 | Subarray Sum Equals K | Algorithms | Medium |
| 548 | Split Array with Equal Sum $ | Algorithms | Medium |
| 543 | Diameter of Binary Tree | Algorithms | Easy |
| 538 | Convert BST to Greater Tree | Algorithms | Easy |
| 533 | Lonely Pixel II $ | Algorithms | Medium |
| 532 | K-diff Pairs in an Array | Algorithms | Easy |
| 531 | Lonely Pixel I $ | Algorithms | Medium |
| 530 | Minimum Absolute Difference in BST | Algorithms | Easy |
| 501 | Find Mode in Binary Search Tree | Algorithms | Easy |
| 495 | Teemo Attacking | Algorithms | Medium |
| 485 | Max Consecutive Ones | Algorithms | Easy |
| 476 | Number Complement | Algorithms | Easy |
| 461 | Hamming Distance | Algorithms | Easy |
| 455 | Assign Cookies | Algorithms | Easy |
| 448 | Find All Numbers Disappeared in an Array | Algorithms | Easy |
| 442 | Find All Duplicates in an Array | Algorithms | Medium |
| 437 | Path Sum III | Algorithms | Easy |
| 414 | Third Maximum Number | Algorithms | Easy |
| 405 | Convert a Number to Hexadecimal | Algorithms | Easy |
| 404 | Sum of Left Leaves | Algorithms | Easy |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Algorithms | Hard |
| 380 | Insert Delete GetRandom O(1) | Algorithms | Medium |
| 371 | Sum of Two Integers | Algorithms | Easy |
| 370 | Range Addition $ | Algorithms | Medium |
| 346 | Moving Average from Data Stream $ | Algorithms | Easy |
| 342 | Power of Four | Algorithms | Easy |
| 339 | Nested List Weight Sum $ | Algorithms | Easy |
| 292 | Nim Game | Algorithms | Easy |
| 289 | Game of Life | Algorithms | Medium |
| 287 | Find the Duplicate Number | Algorithms | Medium |
| 283 | Move Zeroes | Algorithms | Easy |
| 280 | Wiggle Sort $ | Algorithms | Medium |
| 277 | Find the Celebrity $ | Algorithms | Medium |
| 268 | Missing Number | Algorithms | Easy |
| 259 | 3Sum Smaller $ | Algorithms | Medium |
| 257 | Binary Tree Paths | Algorithms | Easy |
| 252 | Meeting Rooms $ | Algorithms | Easy |
| 245 | Shortest Word Distance III $ | Algorithms | Medium |
| 243 | Shortest Word Distance $ | Algorithms | Easy |
| 238 | Product of Array Except Self | Algorithms | Medium |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Algorithms | Easy |
| 229 | Majority Element II | Algorithms | Medium |
| 228 | Summary Ranges | Algorithms | Medium |
| 226 | Invert Binary Tree | Algorithms | Easy |
| 219 | Contains Duplicate II | Algorithms | Easy |
| 217 | Contains Duplicate | Algorithms | Easy |
| 216 | Combination Sum III | Algorithms | Medium |
| 209 | Minimum Size Subarray Sum | Algorithms | Medium |
| 205 | Isomorphic Strings | Algorithms | Easy |
| 204 | Count Primes | Algorithms | Easy |
| 202 | Happy Number | Algorithms | Easy |
| 191 | Number of 1 bits | Algorithms | Easy |
| 190 | Reverse Bits | Algorithms | Easy |
| 189 | Rotate Array | Algorithms | Easy |
| 170 | Two Sum III - Data structure design $ | Algorithms | Easy |
| 169 | Majority Element | Algorithms | Easy |
| 167 | Two Sum II - Input array is sorted | Algorithms | Easy |
| 163 | Missing Ranges $ | Algorithms | Medium |
| 162 | Find Peak Element | Algorithms | Medium |
| 153 | Find Minimum in Rotated Sorted Array | Algorithms | Medium |
| 152 | Maximum Product Subarray | Algorithms | Medium |
| 136 | Single Number | Algorithms | Easy |
| 122 | Best Time to Buy and Sell Stock II | Algorithms | Easy |
| 121 | Best Time to Buy and Sell Stock | Algorithms | Easy |
| 120 | Triangle | Algorithms | Medium |
| 119 | Pascal's Triangle II | Algorithms | Easy |
| 118 | Pascal's Triangle | Algorithms | Easy |
| 112 | Path Sum | Algorithms | Easy |
| 111 | Minimum Depth of Binary Tree | Algorithms | Easy |
| 110 | Balanced Binary Tree | Algorithms | Easy |
| 108 | Convert Sorted Array to Binary Search Tree | Algorithms | Easy |
| 107 | Binary Tree Level Order Traversal II | Algorithms | Easy |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Algorithms | Medium |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Algorithms | Medium |
| 104 | Maximum Depth of Binary Tree | Algorithms | Easy |
| 101 | Symmetric Tree | Algorithms | Easy |
| 100 | Same Tree | Algorithms | Easy |
| 90 | Subsets II | Algorithms | Medium |
| 88 | Merge Sorted Array | Algorithms | Easy |
| 81 | Search in Rotated Sorted Array II | Algorithms | Medium |
| 80 | Remove Duplicates from Sorted Array II | Algorithms | Medium |
| 79 | Word Search | Algorithms | Medium |
| 78 | Subsets | Algorithms | Medium |
| 75 | Sort Colors | Algorithms | Medium |
| 74 | Search a 2D Matrix | Algorithms | Medium |
| 73 | Set Matrix Zeroes | Algorithms | Medium |
| 66 | Plus One | Algorithms | Easy |
| 64 | Minimum Path Sum | Algorithms | Medium |
| 63 | Unique Paths II | Algorithms | Medium |
| 62 | Unique Paths | Algorithms | Medium |
| 59 | Spiral Matrix II | Algorithms | Medium |
| 56 | Merge Intervals | Algorithms | Medium |
| 55 | Jump Game | Algorithms | Medium |
| 54 | Spiral Matrix | Algorithms | Medium |
| 53 | Maximum Subarray | Algorithms | Easy |
| 48 | Rotate Image | Algorithms | Medium |
| 40 | Combination Sum II | Algorithms | Medium |
| 39 | Combination Sum | Algorithms | Medium |
| 35 | Search Insert Position | Algorithms | Easy |
| 34 | Search for a Range | Algorithms | Medium |
| 33 | Search in Rotated Sorted Array | Algorithms | Medium |
| 31 | Next Permutation | Algorithms | Medium |
| 27 | Remove Element | Algorithms | Easy |
| 26 | Remove Duplicates from Sorted Array | Algorithms | Easy |
| 18 | 4Sum | Algorithms | Medium |
| 16 | 3Sum Closest | Algorithms | Medium |
| 15 | 3Sum | Algorithms | Medium |
| 11 | Container With Most Water | Algorithms | Medium |
| 1 | Two Sum | Algorithms | Easy |
LeetCode Questions List (LeetCode 问题列表)- Java Solutions的更多相关文章
- All LeetCode Questions List 题目汇总
All LeetCode Questions List(Part of Answers, still updating) 题目汇总及部分答案(持续更新中) Leetcode problems clas ...
- Summary: curated List of Top 75 LeetCode Questions to Save Your Time
Facebook / Eng tech lead Dec 30, 2018 68 Comments New Year Gift to every fellow time-constrained ...
- Atitit.得到网络邻居列表java php c#.net python
Atitit.得到网络邻居列表java php c#.net python 1. 获取workgroup net view /domain1 2. 得到网络邻居列表1 3. 得到机器的ip 通过p ...
- Java实现 LeetCode 341 扁平化嵌套列表迭代器
341. 扁平化嵌套列表迭代器 给你一个嵌套的整型列表.请你设计一个迭代器,使其能够遍历这个整型列表中的所有整数. 列表中的每一项或者为一个整数,或者是另一个列表.其中列表的元素也可能是整数或是其他列 ...
- LeetCode算法题-Baseball Game(Java实现)
这是悦乐书的第288次更新,第305篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Easy级别的第156题(顺位题号是682).你现在是棒球比赛点记录器.给定一个字符串列表,每个字符串 ...
- LeetCode算法题-Keyboard Row(Java实现)
这是悦乐书的第245次更新,第258篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Easy级别的第112题(顺位题号是500).给定一个单词列表,返回可以在美国键盘的一行上使用字母表键 ...
- LeetCode算法题-House Robber(Java实现)
这是悦乐书的第187次更新,第189篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Easy级别的第46题(顺位题号是198).你是一个专业的强盗,计划在街上抢劫房屋. 每个房子都藏着一 ...
- LeetCode第151场周赛(Java)
这是我第一次写周赛的题目,而且还是虚拟的.从这次起,以后就将所有错过的题目都写到博客来.当然既然是我错的,那代码肯定不是我自己的.我会注明来源.并且我会自己敲一遍.多总结总是没坏处的. 另外比较糟糕的 ...
- 【Leetcode】Evaluate Reverse Polish Notation JAVA
一.问题描述 Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators ...
随机推荐
- eclipse 项目引入第三方jar包 3种方法
我们在用Eclipse开发程序的时候,经常要用到第三方jar包.引入jar包不是一个小问题,由于jar包位置不清楚,而浪费时间.下面配图说明3种Eclipse引入jar包的方式. 1.最常用的普通操作 ...
- Java:Object类的equals()方法 如何编写一个完美的equals()方法
一 代码实例: package freewill.objectequals; /** * @author freewill * @see Core Java page161 * @desc get ...
- hdu 6197 array array array
array array array Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others ...
- cas-单点登录-应用说明
单独在tomcat中启动cas 1, 我的百度网盘中有 cas 和 tomcat-cas 压缩包 http://pan.baidu.com/s/1bnxVRkF 直接解压缩就可以使用. 2, ...
- 使用cocos2d脚本生成lua绑定
这几天要老大要求把DragonBones移到cocos2dx 3.0 里边,并且绑定lua使用接口.因为刚学lua,使用的引擎也刚从2.2改为3.0,各种不熟悉,折腾了好几天才弄完,有空了总结一下 这 ...
- 获取sd卡的总大小和可用大小
- Block Demo
1.预定义Block typedef void(^myblock1)(int a,int b); 2.将Block做为类的属性 @property(nonatomic,strong) myblock ...
- 第4章 同步控制 Synchronization ----死锁(DeadLock)
Jeffrey Richter 在他所主持的 Win32 Q&A 专栏(Microsoft Systems Journal,1996/07)中曾经提到过,Windows NT 和 Window ...
- vector 利用swap 函数进行内存的释放 vector<int>().swap
首先,vector与deque不同,其内存占用空间只会增长,不会减小.比如你首先分配了10,000个字节,然后erase掉后面9,999个,则虽然有效元素只有一个,但是内存占用仍为10,000个.所有 ...
- OWLQN算法
一.BFGS算法 算法思想如下: Step1 取初始点,初始正定矩阵,允许误差,令: Step2 计算: Step3 计算,使得 : Step4 令: Step5 如果,则取为 ...