# LeetCode

**Repository Path**: elviswhu/LeetCode

## Basic Information

- **Project Name**: LeetCode
- **Description**: leetcode
- **Primary Language**: Unknown
- **License**: GPL-3.0
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-03-29
- **Last Updated**: 2021-05-07

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

LeetCode
========
If you like this project, please leave me a star. ★
### LeetCode Algorithm　

| No | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|　01 |　　　[Two Sum](https://leetcode.com/problems/two-sum/) | 　　[java](algorithms/hashmap/Leetcode01.java)|　Easy |
|　02 |　　　[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | 　　[java](algorithms/linkedlist/Leetcode02.java)|　Medium |
|　03 |　　　[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | 　　[java](algorithms/hashmap/Leetcode03.java)|　Medium |
|　05 |　　　[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | 　　[java](algorithms/dp/Leetcode05.java)|　Medium |
|　06 |　　　[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) | 　　[java](algorithms/string/Leetcode06.java)|　Medium |
|　07 |　　　[Reverse Integer](https://leetcode.com/problems/reverse-integer/) | 　　[java](algorithms/math/Leetcode07.java)|　Easy |
|　08 |　　　[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | 　　[java](algorithms/string/Leetcode08.java)|　Medium |
|　09 |　　　[Palindrome Number](https://leetcode.com/problems/palindrome-number/) | 　　[java](algorithms/math/Leetcode09.java)|　Easy |
|　10 |　　　[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | 　　[java](algorithms/dp/Leetcode10.java)|　Hard |
|　11 |　　　[Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | 　　[java](algorithms/array/Leetcode11.java)|　Medium |
|　12 |　　　[Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | 　　[java](algorithms/string/Leetcode12.java)|　Medium |
|　13 |　　　[Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | 　　[java](algorithms/string/Leetcode13.java)|　Easy |
|　14 |　　　[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | 　　[java](algorithms/string/Leetcode14.java)|　Easy |
|　15 |　　　[3Sum](https://leetcode.com/problems/3sum/) | 　　[java](algorithms/array/Leetcode15.java)|　Medium |
|　16 |　　　[3Sum-closest](https://leetcode.com/problems/3sum-closest/) | 　　[java](algorithms/array/Leetcode16.java)|　Medium |
|　17 |　　　[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | 　　[java](algorithms/dfs/Leetcode1７.java)|　Medium |
|　18 |　　　[4Sum](https://leetcode.com/problems/4sum/) | 　　[java](algorithms/array/Leetcode18.java)|　Medium |
|　19 |　　　[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | 　　[java](algorithms/linkedlist/Leetcode19.java)|　Medium |
|　20 |　　　[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | 　　[java](algorithms/stack/Leetcode20.java)|　Easy |
|　21 |　　　[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | 　　[java](algorithms/linkedlist/Leetcode21.java)|　Easy |
|　22 |　　　[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | 　　[java](algorithms/backtracking/Leetcode22.java)|　Medium |
|　23 |　　　[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | 　　[java](algorithms/linkedlist/Leetcode23.java)|　Hard |
|　24 |　　　[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | 　　[java](algorithms/linkedlist/Leetcode24.java)|　Medium |
|　25 |　　　[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | 　　[java](algorithms/linkedlist/Leetcode25.java)|　Hard |
|　26 |　　　[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | 　　[java](algorithms/array/Leetcode26.java)|　Easy |
|　27 |　　　[Remove Element](https://leetcode.com/problems/remove-element/) | 　　[java](algorithms/array/Leetcode27.java)|　Easy |
|　28 |　　　[Implement strStr()](https://leetcode.com/problems/implement-strstr/) | 　　[java](algorithms/string/Leetcode28.java)|　Easy |
|　29 |　　　[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | 　　[java](algorithms/math/Leetcode29.java)|　Medium |
|　30 |　　　[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/) | 　　[java](algorithms/hashmap/Leetcode30.java)|　Hard |
|　31 |　　　[Next Permutation](https://leetcode.com/problems/next-permutation/) | 　　[java](algorithms/array/Leetcode31.java)|　Medium |
|　32 |　　　[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | 　　[java](algorithms/dp/Leetcode32.java)|　Hard |
|　33 |　　　[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | 　　[java](algorithms/binarysearch/Leetcode33.java)|　Medium |
|　34 |　　　[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | 　　[java](algorithms/binarysearch/Leetcode34.java)|　Medium |
|　35 |　　　[Search Insert Position](https://leetcode.com/problems/search-insert-position/) | 　　[java](algorithms/binarysearch/Leetcode35.java)|　Easy |
|　38 |　　　[Count and Say](https://leetcode.com/problems/count-and-say/) | 　　[java](algorithms/string/Leetcode38.java)|　Easy |
|　39 |　　　[Combination Sum](https://leetcode.com/problems/combination-sum/) | 　　[java](algorithms/backtracking/Leetcode39.java)|　Medium |
|　40 |　　　[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | 　　[java](algorithms/backtracking/Leetcode40.java)|　Medium |
|　42 |　　　[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | 　　[java](algorithms/doublepointer/Leetcode42.java)|　Hard |
|　46 |　　　[Permutations](https://leetcode.com/problems/permutations/) | 　　[java](algorithms/backtracking/Leetcode46.java)|　Medium |
|　47 |　　　[Permutations II](https://leetcode.com/problems/permutations-ii/) | 　　[java](algorithms/backtracking/Leetcode47.java)|　Medium |
|　49 |　　　[Group Anagrams](https://leetcode.com/problems/group-anagrams/) | 　　[java](algorithms/hashmap/Leetcode49.java)|　Medium |
|　50 |　　　[Pow(x, n)](https://leetcode.com/problems/powx-n/) | 　　[java](algorithms/math/Leetcode50.java)|　Medium |
|　51 |　　　[N-Queens](https://leetcode.com/problems/n-queens/) | 　　[java](algorithms/backtracking/Leetcode51.java)|　Hard |
|　52 |　　　[N-Queens II](https://leetcode.com/problems/n-queens-ii/) | 　　[java](algorithms/backtracking/Leetcode52.java)|　Hard |
|　53 |　　　[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | 　　[java](algorithms/dp/Leetcode53.java)|　Easy |
|　54 |　　　[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | 　　[java](algorithms/array/Leetcode54.java)|　Medium |
|　55 |　　　[Jump Game](https://leetcode-cn.com/problems/jump-game/) | 　　[java](algorithms/array/Leetcode55.java)|　Medium |
|　56 |　　　[Merge Intervals](https://leetcode.com/problems/merge-intervals/) | 　　[java](algorithms/array/Leetcode56.java)|　Medium |
|　57 |　　　[Insert Interval](https://leetcode.com/problems/insert-interval/) | 　　[java](algorithms/array/Leetcode57.java)|　Hard |
|　58 |　　　[Length of Last Word](https://leetcode.com/problems/length-of-last-word/) | 　　[java](algorithms/string/Leetcode58.java)|　Easy |
|　59 |　　　[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | 　　[java](algorithms/array/Leetcode59.java)|　Medium |
|　60 |　　　[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/) | 　　[java](algorithms/backtracking/Leetcode60.java)|　Medium |
|　61 |　　　[Rotate List](https://leetcode.com/problems/rotate-list/) | 　　[java](algorithms/linkedlist/Leetcode61.java)|　Medium |
|　62 |　　　[Unique Paths](https://leetcode.com/problems/unique-paths/) | 　　[java](algorithms/dp/Leetcode62.java)|　Medium |
|　63 |　　　[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | 　　[java](algorithms/dp/Leetcode63.java)|　Medium |
|　64 |　　　[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | 　　[java](algorithms/dp/Leetcode64.java)|　Medium |
|　65 |　　　[Valid Number](https://leetcode.com/problems/valid-number/) | 　　[java](algorithms/string/Leetcode65.java)|　Hard |
|　66 |　　　[Plus One](https://leetcode.com/problems/plus-one/) | 　　[java](algorithms/array/Leetcode66.java)|　Easy |
|　67 |　　　[Add Binary](https://leetcode.com/problems/add-binary/) | 　　[java](algorithms/string/Leetcode67.java)|　Easy |
|　69 |　　　[Sqrt(x)](https://leetcode.com/problems/sqrtx/) | 　　[java](algorithms/math/Leetcode69.java)|　Easy |
|　70 |　　　[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | 　　[java](algorithms/dp/Leetcode70.java)|　Easy |
|　72 |　　　[Edit Distance](https://leetcode.com/problems/edit-distance/) | 　　[java](algorithms/dp/Leetcode72.java)|　Hard |
|　73 |　　　[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | 　　[java](algorithms/array/Leetcode73.java)|　Medium |
|　74 |　　　[Search a 2d Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | 　　[java](algorithms/array/Leetcode74.java)|　Medium |
|　75 |　　　[Sort Colors](https://leetcode.com/problems/sort-colors/) | 　　[java](algorithms/array/Leetcode75.java)|　Medium |
|　76 |　　　[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | 　　[java](algorithms/slidingwindow/Leetcode76.java)|　Hard |
|　77 |　　　[Combinations](https://leetcode.com/problems/combinations/) | 　　[java](algorithms/backtracking/Leetcode77.java)|　Medium |
|　78 |　　　[Subsets](https://leetcode.com/problems/subsets/) | 　　[java](algorithms/backtracking/Leetcode78.java)|　Medium |
|　79 |　　　[Word Search](https://leetcode.com/problems/word-search/) | 　　[java](algorithms/dfs/Leetcode79.java)|　Medium |
|　80 |　　　[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | 　　[java](algorithms/array/Leetcode80.java)|　Medium |
|　81 |　　　[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) | 　　[java](algorithms/binarysearch/Leetcode81.java)|　Medium |
|　82 |　　　[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | 　　[java](algorithms/linkedlist/Leetcode82.java)|　Medium |
|　83 |　　　[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | 　　[java](algorithms/linkedlist/Leetcode83.java)|　Easy |
|　84 |　　　[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | 　　[java](algorithms/stack/Leetcode84.java)|　Hard |
|　86 |　　　[Partition List](https://leetcode.com/problems/partition-list/) | 　　[java](algorithms/linkedlist/Leetcode86.java)|　Medium |
|　87 |　　　[Scramble String](https://leetcode.com/problems/scramble-string/) | 　　[java](algorithms/dp/Leetcode87.java)|　Hard |
|　88 |　　　[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | 　　[java](algorithms/array/Leetcode88.java)|　Easy |
|　89 |　　　[Gray Code](https://leetcode.com/problems/gray-code/submissions/) | 　　[java](algorithms/backtracking/Leetcode89.java)|　Medium |
|　90 |　　　[Subsets II](https://leetcode.com/problems/subsets-ii/) | 　　[java](algorithms/backtracking/Leetcode90.java)|　Medium |
|　91 |　　　[Decode Ways](https://leetcode.com/problems/decode-ways/) | 　　[java](algorithms/dp/Leetcode91.java)|　Medium |
|　92 |　　　[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | 　　[java](algorithms/linkedlist/Leetcode92.java)|　Medium |
|　93 |　　　[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | 　　[java](algorithms/backtracking/Leetcode93.java)|　Medium |
|　94 |　　　[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | 　　[java](algorithms/tree/Leetcode94.java)|　Medium |
|　95 |　　　[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) | 　　[java](algorithms/tree/Leetcode95.java)|　Medium |
|　97 |　　　[Interleaving String](https://leetcode.com/problems/interleaving-string/) | 　　[java](algorithms/dp/Leetcode97.java)|　Hard |
|　98 |　　　[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | 　　[java](algorithms/tree/Leetcode98.java)|　Medium |
|　99 |　　　[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/) | 　　[java](algorithms/tree/Leetcode99.java)|　Hard |
|　100 |　　　[Same Tree](https://leetcode.com/problems/same-tree/) | 　　[java](algorithms/tree/Leetcode100.java)|　Easy |
|　101 |　　　[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | 　　[java](algorithms/tree/Leetcode101.java)|　Easy |
|　102 |　　　[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | 　　[java](algorithms/tree/Leetcode102.java)|　Medium |
|　104 |　　　[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | 　　[java](algorithms/tree/Leetcode104.java)|　Easy |
|　105 |　　　[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | 　　[java](algorithms/tree/Leetcode105.java)|　Medium |
|　107 |　　　[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) | 　　[java](algorithms/tree/Leetcode107.java)|　Easy |
|　110 |　　　[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | 　　[java](algorithms/dfs/Leetcode110.java)|　Easy |
|　111 |　　　[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | 　　[java](algorithms/dfs/Leetcode111.java)|　Easy |
|　112 |　　　[Path Sum](https://leetcode.com/problems/path-sum/) | 　　[java](algorithms/tree/Leetcode112.java)|　Easy |
|　113 |　　　[Path Sum II](https://leetcode.com/problems/path-sum-ii/) | 　　[java](algorithms/tree/Leetcode113.java)|　Medium |
|　114 |　　　[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) | 　　[java](algorithms/tree/Leetcode114.java)|　Medium |
|　116 |　　　[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | 　　[java](algorithms/tree/Leetcode116.java)|　Medium |
|　117 |　　　[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | 　　[java](algorithms/tree/Leetcode117.java)|　Medium |
|　118 |　　　[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | 　　[java](algorithms/array/Leetcode118.java)|　Easy |
|　119 |　　　[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) | 　　[java](algorithms/array/Leetcode119.java)|　Easy |
|　120 |　　　[Triangle](https://leetcode.com/problems/triangle/) | 　　[java](algorithms/dp/Leetcode120.java)|　Medium |
|　121 |　　　[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | 　　[java](algorithms/dp/Leetcode121.java)|　Easy |
|　122 |　　　[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | 　　[java](algorithms/dp/Leetcode122.java)|　Easy |
|　124 |　　　[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | 　　[java](algorithms/tree/Leetcode124.java)|　Hard |
|　125 |　　　[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | 　　[java](algorithms/string/Leetcode125.java)|　Easy |
|　127 |　　　[Word Ladder](https://leetcode.com/problems/word-ladder/) | 　　[java](algorithms/bfs/Leetcode127.java)|　Hard |
|　128 |　　　[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | 　　[java](algorithms/set/Leetcode128.java)|　Hard |
|　129 |　　　[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | 　　[java](algorithms/dfs/Leetcode129.java)|　Medium |   
|　131 |　　　[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | 　　[java](algorithms/backtracking/Leetcode131.java)|　Medium |   
|　132 |　　　[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/) | 　　[java](algorithms/dp/Leetcode132.java)|　Hard |   
|　133 |　　　[Clone Graph](https://leetcode.com/problems/clone-graph/) | 　　[java](algorithms/dfs/Leetcode133.java)|　Medium |   
|　134 |　　　[Gas Station](https://leetcode.com/problems/gas-station/) | 　　[java](algorithms/greed/Leetcode134.java)|　Medium |   
|　136 |　　　[Single Number](https://leetcode.com/problems/single-number/) | 　　[java](algorithms/bit/Leetcode136.java)|　Easy |   
|　137 |　　　[Single Number II](https://leetcode.com/problems/single-number-ii/) | 　　[java](algorithms/bit/Leetcode137.java)|　Medium |   
|　141 |　　　[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | 　　[java](algorithms/linkedlist/Leetcode141.java)|　Easy |   
|　142 |　　　[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | 　　[java](algorithms/linkedlist/Leetcode142.java)|　Medium |   
|　143 |　　　[Reorder List](https://leetcode.com/problems/reorder-list/) | 　　[java](algorithms/linkedlist/Leetcode143.java)|　Medium |   
|　144 |　　　[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | 　　[java](algorithms/tree/Leetcode144.java)|　Medium |   
|　145 |　　　[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | 　　[java](algorithms/tree/Leetcode145.java)|　Hard |
|　146 |　　　[LRU Cache](https://leetcode.com/problems/lru-cache/) | 　　[java](algorithms/hashmap/Leetcode146.java)|　Medium |   
|　147 |　　　[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/) | 　　[java](algorithms/linkedlist/Leetcode147.java)|　Medium |   
|　148 |　　　[Sort List](https://leetcode.com/problems/sort-list/) | 　　[java](algorithms/linkedlist/Leetcode148.java)|　Medium |   
|　150 |　　　[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | 　　[java](algorithms/stack/Leetcode150.java)|　Medium |   
|　151 |　　　[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | 　　[java](algorithms/string/Leetcode151.java)|　Medium |   
|　152 |　　　[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | 　　[java](algorithms/dp/Leetcode152.java)|　Medium |   
|　153 |　　　[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | 　　[java](algorithms/binarysearch/Leetcode153.java)|　Medium |   
|　154 |　　　[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) | 　　[java](algorithms/binarysearch/Leetcode154.java)|　Hard |   
|　155 |　　　[Min Stack](https://leetcode.com/problems/min-stack/) | 　　[java](algorithms/stack/Leetcode155.java)|　Easy |   
|　160 |　　　[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | 　　[java](algorithms/linkedlist/Leetcode160.java)|　Easy |   
|　162 |　　　[Find Peak Element](https://leetcode.com/problems/find-peak-element/) | 　　[java](algorithms/binarysearch/Leetcode162.java)|　Medium |   
|　165 |　　　[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | 　　[java](algorithms/string/Leetcode165.java)|　Medium |   
|　167 |　　　[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | 　　[java](algorithms/binarysearch/Leetcode167.java)|　Easy |   
|　168 |　　　[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | 　　[java](algorithms/math/Leetcode168.java)|　Easy |
|　169 |　　　[Majority Element](https://leetcode.com/problems/majority-element/) | 　　[java](algorithms/array/Leetcode169.java)|　Easy |
|　171 |　　　[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) | 　　[java](algorithms/math/Leetcode171.java)|　Easy |
|　172 |　　　[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) | 　　[java](algorithms/math/Leetcode172.java)|　Easy |
|　173 |　　　[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | 　　[java](algorithms/tree/Leetcode173.java)|　Medium |
|　174 |　　　[Dungeon Game](https://leetcode.com/problems/dungeon-game/) | 　　[java](algorithms/dp/Leetcode174.java)|　Hard |
|　179 |　　　[Largest Number](https://leetcode.com/problems/largest-number/) | 　　[java](algorithms/array/Leetcode179.java)|　Medium |
|　187 |　　　[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/) | 　　[java](algorithms/hashmap/Leetcode187.java)|　Medium |
|　188 |　　　[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | 　　[java](algorithms/dp/Leetcode188.java)|　Hard |
|　189 |　　　[Rotate Array](https://leetcode.com/problems/rotate-array/) | 　　[java](algorithms/array/Leetcode189.java)|　Easy |
|　190 |　　　[Reverse Bits](https://leetcode.com/problems/reverse-bits/) | 　　[java](algorithms/bit/Leetcode190.java)|　Easy |
|　191 |　　　[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | 　　[java](algorithms/bit/Leetcode191.java)|　Easy |
|　198 |　　　[House Robber](https://leetcode.com/problems/house-robber/) | 　　[java](algorithms/dp/Leetcode198.java)|　Easy |   
|　199 |　　　[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | 　　[java](algorithms/tree/Leetcode199.java)|　Medium |   
|　200 |　　　[Number of Islands](https://leetcode.com/problems/number-of-islands/) | 　　[java](algorithms/dfs/Leetcode200.java)|　Medium |   
|　201 |　　　[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | 　　[java](algorithms/bit/Leetcode201.java)|　Medium |
|　202 |　　　[Happy Number](https://leetcode.com/problems/happy-number/) | 　　[java](algorithms/math/Leetcode202.java)|　Easy |
|　203 |　　　[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | 　　[java](algorithms/linkedlist/Leetcode203.java)|　Easy |
|　204 |　　　[Count Primes](https://leetcode.com/problems/count-primes/) | 　　[java](algorithms/math/Leetcode204.java)|　Easy |
|　205 |　　　[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) | 　　[java](algorithms/hashmap/Leetcode205.java)|　Easy |
|　206 |　　　[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | 　　[java](algorithms/linkedlist/Leetcode206.java)|　Easy |   
|　208 |　　　[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | 　　[java](algorithms/tree/Leetcode208.java)|　Medium |   
|　209 |　　　[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | 　　[java](algorithms/slidingwindow/Leetcode209.java)|　Medium |   
|　213 |　　　[House Robber II](https://leetcode.com/problems/house-robber-ii/) | 　　[java](algorithms/dp/Leetcode213.java)|　Medium |
|　215 |　　　[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | 　　[java](algorithms/sort/Leetcode215.java)|　Medium |
|　216 |　　　[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/) | 　　[java](algorithms/backtracking/Leetcode216.java)|　Medium |
|　217 |　　　[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | 　　[java](algorithms/hashmap/Leetcode217.java)|　Easy |
|　219 |　　　[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | 　　[java](algorithms/hashmap/Leetcode219.java)|　Easy |
|　220 |　　　[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) | 　　[java](algorithms/treeset/Leetcode220.java)|　Medium |
|　221 |　　　[Maximal Square](https://leetcode.com/problems/maximal-square/) | 　　[java](algorithms/dp/Leetcode221.java)|　Medium |
|　225 |　　　[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | 　　[java](algorithms/stack/Leetcode225.java)|　Easy | 
|　226 |　　　[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | 　　[java](algorithms/tree/Leetcode226.java)|　Easy | 
|　231 |　　　[Power of Two](https://leetcode.com/problems/power-of-two/) | 　　[java](algorithms/math/Leetcode231.java)|　Easy |
|　234 |　　　[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | 　　[java](algorithms/linkedlist/Leetcode234.java)|　Easy |
|　235 |　　　[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | 　　[java](algorithms/tree/Leetcode235.java)|　Easy |
|　236 |　　　[Lowest Common Ancestor of a Binary Search Tree II](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | 　　[java](algorithms/tree/Leetcode236.java)|　Medium |
|　237 |　　　[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | 　　[java](algorithms/linkedlist/Leetcode237.java)|　Easy |
|　238 |　　　[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | 　　[java](algorithms/array/Leetcode238.java)|　Medium |
|　239 |　　　[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | 　　[java](algorithms/slidingwindow/Leetcode239.java)|　Hard |
|　242 |　　　[Valid Anagram](https://leetcode.com/problems/valid-anagram/) | 　　[java](algorithms/hashmap/Leetcode242.java)|　Easy |
|　257 |　　　[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) | 　　[java](algorithms/dfs/Leetcode257.java)|　Easy |
|　258 |　　　[Add Digits](https://leetcode.com/problems/add-digits/) | 　　[java](algorithms/math/Leetcode258.java)|　Easy |
|　260 |　　　[Single Number III](https://leetcode.com/problems/single-number-iii/) | 　　[java](algorithms/bit/Leetcode260.java)|　Medium |
|　263 |　　　[Ugly Number](https://leetcode.com/problems/ugly-number/) | 　　[java](algorithms/math/Leetcode263.java)|　Easy | 
|　264 |　　　[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/) | 　　[java](algorithms/dp/Leetcode264.java)|　Medium | 
|　268 |　　　[Missing Number](https://leetcode.com/problems/missing-number/) | 　　[java](algorithms/bit/Leetcode268.java)|　Easy | 
|　279 |　　　[Perfect Squares](https://leetcode.com/problems/perfect-squares/) | 　　[java](algorithms/dp/Leetcode279.java)|　Medium |
|　283 |　　　[Move Zeroes](https://leetcode.com/problems/move-zeroes/) | 　　[java](algorithms/array/Leetcode283.java)|　Easy |
|　287 |　　　[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | 　　[java](algorithms/binarysearch/Leetcode287.java)|　Medium |
|　290 |　　　[Word Pattern](https://leetcode.com/problems/word-pattern/) | 　　[java](algorithms/hashmap/Leetcode290.java)|　Easy |
|　312 |　　　[Burst Balloons](https://leetcode.com/problems/burst-balloons/) | 　　[java](algorithms/dp/Leetcode312.java)|　Hard |
|　313 |　　　[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/) | 　　[java](algorithms/doublepointer/Leetcode313.java)|　Medium |
|　316 |　　　[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/) | 　　[java](algorithms/stack/Leetcode316.java)|　Hard |
|　322 |　　　[Coin Change](https://leetcode.com/problems/coin-change/) | 　　[java](algorithms/dp/Leetcode322.java)|　Medium |
|　328 |　　　[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | 　　[java](algorithms/linkedlist/Leetcode328.java)|　Medium |
|　334 |　　　[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | 　　[java](algorithms/dp/Leetcode334.java)|　Medium |
|　338 |　　　[Counting Bits](https://leetcode.com/problems/counting-bits/) | 　　[java](algorithms/bit/Leetcode338.java)|　Medium |
|　342 |　　　[Power of Four](https://leetcode.com/problems/power-of-four/) | 　　[java](algorithms/bit/Leetcode342.java)|　Easy |
|　343 |　　　[Integer Break](https://leetcode.com/problems/integer-break/) | 　　[java](algorithms/dp/Leetcode343.java)|　Medium |
|　344 |　　　[Reverse String](https://leetcode.com/problems/reverse-string/) | 　　[java](algorithms/string/Leetcode344.java)|　Easy |
|　345 |　　　[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) | 　　[java](algorithms/string/Leetcode345.java)|　Easy |
|　347 |　　　[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | 　　[java](algorithms/hashmap/Leetcode347.java)|　Medium |
|　349 |　　　[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | 　　[java](algorithms/set/Leetcode349.java)|　Easy |
|　350 |　　　[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | 　　[java](algorithms/hashmap/Leetcode350.java)|　Easy |
|　354 |　　　[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/) | 　　[java](algorithms/dp/Leetcode354.java)|　Hard |
|　355 |　　　[Design Twitter](https://leetcode.com/problems/design-twitter/) | 　　[java](algorithms/hashmap/Leetcode355.java)|　Medium |
|　365 |　　　[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/) | 　　[java](algorithms/math/Leetcode365.java)|　Medium |
|　371 |　　　[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | 　　[java](algorithms/bit/Leetcode371.java)|　Easy |
|　372 |　　　[Super Pow](https://leetcode.com/problems/super-pow/) | 　　[java](algorithms/math/Leetcode372.java)|　Medium |
|　374 |　　　[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | 　　[java](algorithms/binarysearch/Leetcode374.java)|　Easy |
|　377 |　　　[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) | 　　[java](algorithms/dp/Leetcode377.java)|　Medium |
|　380 |　　　[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | 　　[java](algorithms/hashmap/Leetcode380.java)|　Medium |
|　384 |　　　[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/) | 　　[java](algorithms/array/Leetcode384.java)|　Medium |
|　386 |　　　[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/) | 　　[java](algorithms/dfs/Leetcode386.java)|　Medium |
|　387 |　　　[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | 　　[java](algorithms/hashmap/Leetcode387.java)|　Easy |
|　390 |　　　[Elimination Game](https://leetcode.com/problems/elimination-game/) | 　　[java](algorithms/math/Leetcode390.java)|　Medium |
|　397 |　　　[Integer Replacement](https://leetcode.com/problems/integer-replacement/) | 　　[java](algorithms/bit/Leetcode397.java)|　Medium |
|　398 |　　　[Random Pick Index](https://leetcode.com/problems/random-pick-index/) | 　　[java](algorithms/array/Leetcode398.java)|　Medium |
|　400 |　　　[Nth Digit](https://leetcode.com/problems/nth-digit/) | 　　[java](algorithms/math/Leetcode400.java)|　Medium |
|　401 |　　　[Binary Watch](https://leetcode.com/problems/binary-watch/) | 　　[java](algorithms/bit/Leetcode401.java)|　Easy |
|　404 |　　　[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | 　　[java](algorithms/tree/Leetcode404.java)|　Easy |
|　405 |　　　[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/) | 　　[java](algorithms/bit/Leetcode405.java)|　Easy |
|　406 |　　　[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/) | 　　[java](algorithms/greed/Leetcode406.java)|　Medium |
|　409 |　　　[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | 　　[java](algorithms/string/Leetcode409.java)|　Easy |
|　414 |　　　[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/) | 　　[java](algorithms/array/Leetcode414.java)|　Easy |
|　415 |　　　[Add Strings](https://leetcode.com/problems/add-strings/) | 　　[java](algorithms/string/Leetcode415.java)|　Easy |
|　416 |　　　[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) | 　　[java](algorithms/dp/Leetcode416.java)|　Medium |
|　434 |　　　[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/) | 　　[java](algorithms/string/Leetcode434.java)|　Easy |
|　435 |　　　[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) | 　　[java](algorithms/greed/Leetcode435.java)|　Medium |
|　441 |　　　[Arranging Coins](https://leetcode.com/problems/arranging-coins/) | 　　[java](algorithms/binarysearch/Leetcode441.java)|　Easy |
|　442 |　　　[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | 　　[java](algorithms/array/Leetcode442.java)|　Medium |
|　443 |　　　[String Compression](https://leetcode.com/problems/string-compression/) | 　　[java](algorithms/string/Leetcode443.java)|　Medium |
|　447 |　　　[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/) | 　　[java](algorithms/hashmap/Leetcode447.java)|　Easy |
|　448 |　　　[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) | 　　[java](algorithms/array/Leetcode448.java)|　Easy |
|　453 |　　　[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | 　　[java](algorithms/math/Leetcode453.java)|　Easy |
|　454 |　　　[4Sum II](https://leetcode.com/problems/4sum-ii/) | 　　[java](algorithms/hashmap/Leetcode454.java)|　Medium |
|　459 |　　　[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/) | 　　[java](algorithms/string/Leetcode459.java)|　Easy |
|　461 |　　　[Hamming Distance](https://leetcode.com/problems/hamming-distance/) | 　　[java](algorithms/bit/Leetcode461.java)|　Easy |
|　462 |　　　[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | 　　[java](algorithms/math/Leetcode462.java)|　Medium |
|　485 |　　　[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/) | 　　[java](algorithms/array/Leetcode485.java)|　Easy | 
|　491 |　　　[Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/) | 　　[java](algorithms/dfs/Leetcode491.java)|　Medium | 
|　494 |　　　[Target Sum](https://leetcode.com/problems/target-sum/) | 　　[java](algorithms/dp/Leetcode494.java)|　Easy | 
|　496 |　　　[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | 　　[java](algorithms/hashmap/Leetcode496.java)|　Easy | 
|　500 |　　　[Keyboard Row](https://leetcode.com/problems/keyboard-row/) | 　　[java](algorithms/hashmap/Leetcode500.java)|　Medium | 
|　506 |　　　[Relative Ranks](https://leetcode.com/problems/relative-ranks/) | 　　[java](algorithms/hashmap/Leetcode506.java)|　Easy | 
|　509 |　　　[Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | 　　[java](algorithms/dp/Leetcode509.java)|　Easy |
|　518 |　　　[Coin Change 2](https://leetcode.com/problems/coin-change-2/) | 　　[java](algorithms/dp/Leetcode518.java)|　Medium |
|　520 |　　　[Detect Capital](https://leetcode.com/problems/detect-capital/) | 　　[java](algorithms/string/Leetcode520.java)|　Easy |
|　532 |　　　[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | 　　[java](algorithms/doublepointer/Leetcode532.java)|　Easy |
|　543 |　　　[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | 　　[java](algorithms/tree/Leetcode543.java)|　Easy |
|　556 |　　　[Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii/) | 　　[java](algorithms/string/Leetcode556.java)|　Medium |
|　560 |　　　[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | 　　[java](algorithms/hashmap/Leetcode560.java)|　Medium |
|　561 |　　　[Array Partition I](https://leetcode.com/problems/array-partition-i/) | 　　[java](algorithms/array/Leetcode561.java)|　Easy |
|　567 |　　　[Permutation in String](https://leetcode.com/problems/permutation-in-string/) | 　　[java](algorithms/hashmap/Leetcode567.java)|　Medium |
|　575 |　　　[Distribute Candies](https://leetcode.com/problems/distribute-candies/) | 　　[java](algorithms/array/Leetcode575.java)|　Easy |
|　589 |　　　[N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/) | 　　[java](algorithms/tree/Leetcode589.java)|　Easy |
|　590 |　　　[N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/) | 　　[java](algorithms/tree/Leetcode590.java)|　Easy |
|　593 |　　　[Valid Square](https://leetcode.com/problems/valid-square/) | 　　[java](algorithms/math/Leetcode593.java)|　Medium |
|　594 |　　　[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/) | 　　[java](algorithms/hashmap/Leetcode594.java)|　Easy |
|　599 |　　　[Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/) | 　　[java](algorithms/hashmap/Leetcode599.java)|　Medium |
|　611 |　　　[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/) | 　　[java](algorithms/array/Leetcode611.java)|　Medium |
|　637 |　　　[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | 　　[java](algorithms/tree/Leetcode637.java)|　Easy |
|　643 |　　　[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/) | 　　[java](algorithms/array/Leetcode643.java)|　Easy |
|　645 |　　　[Set Mismatch](https://leetcode.com/problems/set-mismatch/) | 　　[java](algorithms/set/Leetcode645.java)|　Easy |
|　650 |　　　[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/) | 　　[java](algorithms/dp/Leetcode650.java)|　Medium |
|　654 |　　　[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/) | 　　[java](algorithms/tree/Leetcode654.java)|　Medium |
|　657 |　　　[Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin/) | 　　[java](algorithms/string/Leetcode657.java)|　Easy |
|　680 |　　　[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | 　　[java](algorithms/string/Leetcode680.java)|　Easy |
|　692 |　　　[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | 　　[java](algorithms/hashmap/Leetcode692.java)|　Medium |
|　696 |　　　[Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/) | 　　[java](algorithms/string/Leetcode696.java)|　Easy |
|　698 |　　　[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/) | 　　[java](algorithms/dfs/Leetcode698.java)|　Medium |
|　709 |　　　[To Lower Case](https://leetcode.com/problems/to-lower-case/) | 　　[java](algorithms/string/Leetcode709.java)|　Easy |
|　713 |　　　[Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/) | 　　[java](algorithms/slidingwindow/Leetcode713.java)|　Medium |
|　718 |　　　[Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | 　　[java](algorithms/dp/Leetcode718.java)|　Medium |
|　721 |　　　[Accounts Merge](https://leetcode-cn.com/problems/accounts-merge/) | 　　[java](algorithms/disjointsets/Leetcode721.java)|　Medium |
|　724 |　　　[Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | 　　[java](algorithms/array/Leetcode724.java)|　Easy |
|　740 |　　　[Delete and Earn](https://leetcode.com/problems/delete-and-earn/) | 　　[java](algorithms/dp/Leetcode740.java)|　Medium |
|　767 |　　　[Reorganize String](https://leetcode.com/problems/reorganize-string/) | 　　[java](algorithms/string/Leetcode767.java)|　Medium |
|　771 |　　　[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/) | 　　[java](algorithms/hashmap/Leetcode771.java)|　Easy |
|　788 |　　　[Rotated Digits](https://leetcode.com/problems/rotated-digits/) | 　　[java](algorithms/string/Leetcode788.java)|　Easy |
|　795 |　　　[Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/) | 　　[java](algorithms/array/Leetcode795.java)|　Medium |
|　804 |　　　[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/) | 　　[java](algorithms/string/Leetcode804.java)|　Easy |
|　819 |　　　[Most Common Word](https://leetcode.com/problems/most-common-word/) | 　　[java](algorithms/string/Leetcode819.java)|　Easy |
|　821 |　　　[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/) | 　　[java](algorithms/string/Leetcode821.java)|　Easy |
|　824 |　　　[Goat Latin](https://leetcode.com/problems/goat-latin/) | 　　[java](algorithms/string/Leetcode824.java)|　Easy |
|　841 |　　　[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/) | 　　[java](algorithms/backtracking/Leetcode841.java)|　Medium |
|　860 |　　　[Lemonade Change](https://leetcode.com/problems/lemonade-change/) | 　　[java](algorithms/greed/Leetcode860.java)|　Easy |
|　866 |　　　[Prime Palindrome](https://leetcode.com/problems/prime-palindrome/) | 　　[java](algorithms/math/Leetcode866.java)|　Medium |
|　877 |　　　[Stone Game](https://leetcode.com/problems/stone-game/) | 　　[java](algorithms/dp/Leetcode877.java)|　Medium |
|　896 |　　　[Monotonic Array](https://leetcode.com/problems/monotonic-array/) | 　　[java](algorithms/array/Leetcode896.java)|　Easy |
|　898 |　　　[Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays/) | 　　[java](algorithms/bit/Leetcode898.java)|　Medium |
|　908 |　　　[Smallest Range I](https://leetcode.com/problems/smallest-range-i/) | 　　[java](algorithms/math/Leetcode908.java)|　Easy |
|　994 |　　　[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | 　　[java](algorithms/bfs/Leetcode994.java)|　Easy | 
|　1011 |　　　[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/) | 　　[java](algorithms/binarysearch/Leetcode1011.java)|　Medium | 
|　1012 |　　　[Numbers With Repeated Digits](https://leetcode.com/problems/numbers-with-repeated-digits/) | 　　[java](algorithms/dp/Leetcode1012.java)|　Hard | 
|　1015 |　　　[Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k/) | 　　[java](algorithms/math/Leetcode1015.java)|　Medium | 
|　1018 |　　　[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/) | 　　[java](algorithms/array/Leetcode1018.java)|　Easy | 
|　1019 |　　　[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/) | 　　[java](algorithms/greed/Leetcode1029.java)|　Medium | 
|　1027 |　　　[Longest Arithmetic Subsequence](https://leetcode.com/problems/longest-arithmetic-subsequence/) | 　　[java](algorithms/dp/Leetcode1027.java)|　Medium | 
|　1029 |　　　[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/) | 　　[java](algorithms/greed/Leetcode1029.java)|　Medium | 
|　1046 |　　　[Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | 　　[java](algorithms/heap/Leetcode1046.java)|　Easy | 
|　1089 |　　　[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/) | 　　[java](algorithms/array/Leetcode1089.java)|　Easy | 
|　1103 |　　　[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/) | 　　[java](algorithms/math/Leetcode1103.java)|　Easy |
|　1115 |　　　[Print FooBar Alternately](https://leetcode.com/problems/print-foobar-alternately/) | 　　[java](algorithms/thread/Leetcode1115.java)|　Medium |
|　1117 |　　　[Building H2O](https://leetcode.com/problems/building-h2o/) | 　　[java](algorithms/thread/Leetcode1117.java)|　Medium |
|　1122 |　　　[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/) | 　　[java](algorithms/array/Leetcode1122.java)|　Easy |
|　1143 |　　　[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | 　　[java](algorithms/dp/Leetcode1143.java)|　Medium |
|　1201 |　　　[Ugly Number III](https://leetcode.com/problems/ugly-number-iii/) | 　　[java](algorithms/binarysearch/Leetcode1201.java)|　Medium |
|　1222 |　　　[Queens That Can Attack the King](https://leetcode.com/problems/queens-that-can-attack-the-king/) | 　　[java](algorithms/array/Leetcode1222.java)|　Medium |
|　1250 |　　　[Check If It Is a Good Array](https://leetcode.com/problems/check-if-it-is-a-good-array/) | 　　[java](algorithms/math/Leetcode1250.java)|　Hard |
|　1325 |　　　[Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/) | 　　[java](algorithms/tree/Leetcode1325.java)|　Medium |
|　1338 |　　　[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/) | 　　[java](algorithms/array/Leetcode1338.java)|　Medium |
### 剑指Offer
| No | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|　03 |　　　[数组中重复的数字](https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO03.java)|　Easy |
|　04 |　　　[二维数组中的查找](https://leetcode-cn.com/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO04.java)|　Easy |
|　05 |　　　[替换空格](https://leetcode-cn.com/problems/ti-huan-kong-ge-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO05.java)|　Easy |
|　06 |　　　[从尾到头打印链表](https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO06.java)|　Easy |
|　09 |　　　[用两个栈实现队列](https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO09.java)|　Easy |
|　10 |　　　[青蛙跳台阶问题](https://leetcode-cn.com/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO10.java)|　Easy |
|　11 |　　　[旋转数组的最小数字](https://leetcode-cn.com/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO11.java)|　Easy |
|　12 |　　　[矩阵中的路径](https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO12.java)|　Medium |
|　13 |　　　[机器人的运动范围](https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO13.java)|　Medium |
|　14 |　　　[剪绳子](https://leetcode-cn.com/problems/jian-sheng-zi-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO14.java)|　Medium |
|　14-2 |　　　[剪绳子 II](https://leetcode-cn.com/problems/jian-sheng-zi-ii-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO14_2.java)|　Medium |
|　15 |　　　[二进制中1的个数](https://leetcode-cn.com/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO15.java)|　Easy |
|　17 |　　　[打印从1到最大的n位数](https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO17.java)|　Easy |
|　18 |　　　[删除链表的节点](https://leetcode-cn.com/problems/shan-chu-lian-biao-de-jie-dian-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO18.java)|　Easy |
|　20 |　　　[表示数值的字符串](https://leetcode-cn.com/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO20.java)|　Medium |
|　21 |　　　[调整数组顺序使奇数位于偶数前面](https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO21.java)|　Easy |
|　22 |　　　[链表中倒数第k个节点](https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO22.java)|　Easy |
|　24 |　　　[反转链表](https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO24.java)|　Easy |
|　39 |　　　[数组中出现次数超过一半的数字](https://leetcode-cn.com/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO39.java)|　Easy |
|　40 |　　　[最小的k个数](https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO40.java)|　Easy |
|　46 |　　　[把数字翻译成字符串](https://leetcode-cn.com/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO46.java)|　Medium |
|　47 |　　　[礼物的最大价值](https://leetcode-cn.com/problems/li-wu-de-zui-da-jie-zhi-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO47.java)|　Medium |
|　50 |　　　[第一个只出现一次的字符](https://leetcode-cn.com/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO50.java)|　Easy |
|　53 |　　　[0～n-1中缺失的数字](https://leetcode-cn.com/problems/que-shi-de-shu-zi-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO53.java)|　Easy |
|　58-2 |　　　[左旋转字符串](https://leetcode-cn.com/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO58_2.java)|　Easy |
|　59-1 |　　　[滑动窗口的最大值](https://leetcode-cn.com/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO59_1.java)|　Easy |
|　60 |　　　[n个骰子的点数](https://leetcode-cn.com/problems/nge-tou-zi-de-dian-shu-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO60.java)|　Easy |
|　64 |　　　[求1+2+…+n](https://leetcode-cn.com/problems/qiu-12n-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO64.java)|　Medium |
|　65 |　　　[不用加减乘除做加法](https://leetcode-cn.com/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO65.java)|　Easy |
|　66 |　　　[构建乘积数组](https://leetcode-cn.com/problems/gou-jian-cheng-ji-shu-zu-lcof/) | 　　[java](algorithms/swordmeansoffer/SMO66.java)|　Medium |

### 面试题
|　02.06 |　　　[回文链表](https://leetcode-cn.com/problems/palindrome-linked-list-lcci/) | 　　[java](algorithms/interview/Interview02_06.java)|　Easy |
|　05.01 |　　　[插入](https://leetcode-cn.com/problems/insert-into-bits-lcci/) | 　　[java](algorithms/interview/Interview05_01.java)|　Easy |
|　08.06 |　　　[汉诺塔问题](https://leetcode-cn.com/problems/hanota-lcci/) | 　　[java](algorithms/interview/Interview08_06.java)|　Easy |
|　16.05 |　　　[阶乘尾数](https://leetcode-cn.com/problems/factorial-zeros-lcci/) | 　　[java](algorithms/interview/Interview16_05.java)|　Easy |
|　16.07 |　　　[最大数值](https://leetcode-cn.com/problems/maximum-lcci/) | 　　[java](algorithms/interview/Interview16_07.java)|　Easy |
|　16.11 |　　　[跳水板](https://leetcode-cn.com/problems/diving-board-lcci/) | 　　[java](algorithms/interview/Interview16_11.java)|　Easy |
|　16.17 |　　　[连续数列](https://leetcode-cn.com/problems/contiguous-sequence-lcci/) | 　　[java](algorithms/interview/Interview16_17.java)|　Easy |

### LCP
| No | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|　02 |　　　[分式化简](https://leetcode-cn.com/problems/deep-dark-fraction/) | 　　[java](algorithms/lcp/LCP09.java)|　Easy |
|　09 |　　　[最小跳跃次数](https://leetcode-cn.com/problems/zui-xiao-tiao-yue-ci-shu/) | 　　[java](algorithms/lcp/LCP09.java)|　Hard |