mirror of
https://github.com/ShusenTang/LeetCode.git
synced 2024-09-02 14:20:01 +00:00
136 lines
27 KiB
Markdown
136 lines
27 KiB
Markdown
# LeetCode
|
||
LeetCode solutions with Chinese explanation. LeetCode中文题解。
|
||
持续更新中，欢迎交流，欢迎star。
|
||
|
||
| # | 题目 | 题解 | 难度 |
|
||
| ---- | -----------| ------- | ------- |
|
||
| 1 |[Two Sum](https://leetcode.com/problems/two-sum)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/1.%Two%Sum.md)|<font color=green>Easy</font>| |
|
||
| 2 |[Add Two Numbers](https://leetcode.com/problems/add-two-numbers)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/2.%Add%Two%Numbers.md)|<font color=orange>Medium</font>| |
|
||
| 3 |[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/3.%Longest%Substring%Without%Repeating%Characters.md)|<font color=orange>Medium</font>| |
|
||
| 5 |[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/5.%Longest%Palindromic%Substring.md)|<font color=orange>Medium</font>| |
|
||
| 6 |[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/6.%ZigZag%Conversion.md)|<font color=orange>Medium</font>| |
|
||
| 7 |[Reverse Integer](https://leetcode.com/problems/reverse-integer)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/7.%Reverse%Integer.md)|<font color=green>Easy</font>| |
|
||
| 8 |[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/8.%String%to%Integer%(atoi).md)|<font color=orange>Medium</font>| |
|
||
| 9 |[Palindrome Number](https://leetcode.com/problems/palindrome-number)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/9.%Palindrome%Number.md)|<font color=green>Easy</font>| |
|
||
| 11 |[Container With Most Water](https://leetcode.com/problems/container-with-most-water)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/11.%Container%With%Most%Water.md)|<font color=orange>Medium</font>| |
|
||
| 12 |[Integer to Roman](https://leetcode.com/problems/integer-to-roman)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/12.%Integer%to%Roman.md)|<font color=orange>Medium</font>| |
|
||
| 13 |[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/13.%Roman%to%Integer.md)|<font color=green>Easy</font>| |
|
||
| 14 |[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/14.%Longest%Common%Prefix.md)|<font color=green>Easy</font>| |
|
||
| 15 |[3Sum](https://leetcode.com/problems/3sum)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/15.%3Sum.md)|<font color=orange>Medium</font>| |
|
||
| 16 |[3Sum Closest](https://leetcode.com/problems/3sum-closest)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/16.%3Sum%Closest.md)|<font color=orange>Medium</font>| |
|
||
| 17 |[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/17.%Letter%Combinations%of%a%Phone%Number.md)|<font color=orange>Medium</font>| |
|
||
| 18 |[4Sum](https://leetcode.com/problems/4sum)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/18.%4Sum.md)|<font color=orange>Medium</font>| |
|
||
| 19 |[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/19.%Remove%Nth%Node%From%End%of%List.md)|<font color=orange>Medium</font>| |
|
||
| 20 |[Valid Parentheses](https://leetcode.com/problems/valid-parentheses)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/20.%Valid%Parentheses.md)|<font color=green>Easy</font>| |
|
||
| 21 |[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/21.%Merge%Two%Sorted%Lists.md)|<font color=green>Easy</font>| |
|
||
| 22 |[Generate Parentheses](https://leetcode.com/problems/generate-parentheses)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/22.%Generate%Parentheses.md)|<font color=orange>Medium</font>| |
|
||
| 24 |[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/24.%Swap%Nodes%in%Pairs.md)|<font color=orange>Medium</font>| |
|
||
| 26 |[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/26.%Remove%Duplicates%from%Sorted%Array.md)|<font color=green>Easy</font>| |
|
||
| 27 |[Remove Element](https://leetcode.com/problems/remove-element)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/27.%Remove%Element.md)|<font color=green>Easy</font>| |
|
||
| 29 |[Divide Two Integers](https://leetcode.com/problems/divide-two-integers)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/29.%Divide%Two%Integers.md)|<font color=orange>Medium</font>| |
|
||
| 31 |[Next Permutation](https://leetcode.com/problems/next-permutation)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/31.%Next%Permutation.md)|<font color=orange>Medium</font>| |
|
||
| 35 |[Search Insert Position](https://leetcode.com/problems/search-insert-position)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/35.%Search%Insert%Position.md)|<font color=green>Easy</font>| |
|
||
| 38 |[Count and Say](https://leetcode.com/problems/count-and-say)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/38.%Count%and%Say.md)|<font color=green>Easy</font>| |
|
||
| 53 |[Maximum Subarray](https://leetcode.com/problems/maximum-subarray)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/53.%Maximum%Subarray.md)|<font color=green>Easy</font>| |
|
||
| 58 |[Length of Last Word](https://leetcode.com/problems/length-of-last-word)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/58.%Length%of%Last%Word.md)|<font color=green>Easy</font>| |
|
||
| 66 |[Plus One](https://leetcode.com/problems/plus-one)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/66.%Plus%One.md)|<font color=green>Easy</font>| |
|
||
| 67 |[Add Binary](https://leetcode.com/problems/add-binary)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/67.%Add%Binary.md)|<font color=green>Easy</font>| |
|
||
| 69 |[Sqrt(x)](https://leetcode.com/problems/sqrtx)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/69.%Sqrt(x).md)|<font color=green>Easy</font>| |
|
||
| 70 |[Climbing Stairs](https://leetcode.com/problems/climbing-stairs)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/70.%Climbing%Stairs.md)|<font color=green>Easy</font>| |
|
||
| 83 |[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/83.%Remove%Duplicates%from%Sorted%List.md)|<font color=green>Easy</font>| |
|
||
| 88 |[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/88.%Merge%Sorted%Array.md)|<font color=green>Easy</font>| |
|
||
| 100 |[Same Tree](https://leetcode.com/problems/same-tree)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/100.%Same%Tree.md)|<font color=green>Easy</font>| |
|
||
| 101 |[Symmetric Tree](https://leetcode.com/problems/symmetric-tree)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/101.%Symmetric%Tree.md)|<font color=green>Easy</font>| |
|
||
| 104 |[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/104.%Maximum%Depth%of%Binary%Tree.md)|<font color=green>Easy</font>| |
|
||
| 107 |[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/107.%Binary%Tree%Level%Order%Traversal%II.md)|<font color=green>Easy</font>| |
|
||
| 108 |[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/108.%Convert%Sorted%Array%to%Binary%Search%Tree.md)|<font color=green>Easy</font>| |
|
||
| 110 |[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/110.%Balanced%Binary%Tree.md)|<font color=green>Easy</font>| |
|
||
| 111 |[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/111.%Minimum%Depth%of%Binary%Tree.md)|<font color=green>Easy</font>| |
|
||
| 112 |[Path Sum](https://leetcode.com/problems/path-sum)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/112.%Path%Sum.md)|<font color=green>Easy</font>| |
|
||
| 118 |[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/118.%Pascal's%Triangle.md)|<font color=green>Easy</font>| |
|
||
| 119 |[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/119.%Pascal's%Triangle%II.md)|<font color=green>Easy</font>| |
|
||
| 121 |[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/121.%Best%Time%to%Buy%and%Sell%Stock.md)|<font color=green>Easy</font>| |
|
||
| 122 |[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/122.%Best%Time%to%Buy%and%Sell%Stock%II.md)|<font color=green>Easy</font>| |
|
||
| 125 |[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/125.%Valid%Palindrome.md)|<font color=green>Easy</font>| |
|
||
| 136 |[Single Number](https://leetcode.com/problems/single-number)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/136.%Single%Number.md)|<font color=green>Easy</font>| |
|
||
| 141 |[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/141.%Linked%List%Cycle.md)|<font color=green>Easy</font>| |
|
||
| 155 |[Min Stack](https://leetcode.com/problems/min-stack)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/155.%Min%Stack.md)|<font color=green>Easy</font>| |
|
||
| 160 |[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/160.%Intersection%of%Two%Linked%Lists.md)|<font color=green>Easy</font>| |
|
||
| 167 |[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii---input-array-is-sorted)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/167.%Two%Sum%II%-%Input%array%is%sorted.md)|<font color=green>Easy</font>| |
|
||
| 168 |[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/168.%Excel%Sheet%Column%Title.md)|<font color=green>Easy</font>| |
|
||
| 169 |[Majority Element](https://leetcode.com/problems/majority-element)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/169.%Majority%Element.md)|<font color=green>Easy</font>| |
|
||
| 171 |[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/171.%Excel%Sheet%Column%Number.md)|<font color=green>Easy</font>| |
|
||
| 172 |[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/172.%Factorial%Trailing%Zeroes.md)|<font color=green>Easy</font>| |
|
||
| 189 |[Rotate Array](https://leetcode.com/problems/rotate-array)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/189.%Rotate%Array.md)|<font color=green>Easy</font>| |
|
||
| 190 |[Reverse Bits](https://leetcode.com/problems/reverse-bits)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/190.%Reverse%Bits.md)|<font color=green>Easy</font>| |
|
||
| 191 |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/191.%Number%of%1%Bits.md)|<font color=green>Easy</font>| |
|
||
| 198 |[House Robber](https://leetcode.com/problems/house-robber)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/198.%House%Robber.md)|<font color=green>Easy</font>| |
|
||
| 202 |[Happy Number](https://leetcode.com/problems/happy-number)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/202.%Happy%Number.md)|<font color=green>Easy</font>| |
|
||
| 203 |[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/203.%Remove%Linked%List%Elements.md)|<font color=green>Easy</font>| |
|
||
| 204 |[Count Primes](https://leetcode.com/problems/count-primes)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/204.%Count%Primes.md)|<font color=green>Easy</font>| |
|
||
| 205 |[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/205.%Isomorphic%Strings.md)|<font color=green>Easy</font>| |
|
||
| 206 |[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/206.%Reverse%Linked%List.md)|<font color=green>Easy</font>| |
|
||
| 217 |[Contains Duplicate](https://leetcode.com/problems/contains-duplicate)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/217.%Contains%Duplicate.md)|<font color=green>Easy</font>| |
|
||
| 219 |[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/219.%Contains%Duplicate%II.md)|<font color=green>Easy</font>| |
|
||
| 225 |[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/225.%Implement%Stack%using%Queues.md)|<font color=green>Easy</font>| |
|
||
| 226 |[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/226.%Invert%Binary%Tree.md)|<font color=green>Easy</font>| |
|
||
| 231 |[Power of Two](https://leetcode.com/problems/power-of-two)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/231.%Power%of%Two.md)|<font color=green>Easy</font>| |
|
||
| 232 |[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/232.%Implement%Queue%using%Stacks.md)|<font color=green>Easy</font>| |
|
||
| 234 |[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/234.%Palindrome%Linked%List.md)|<font color=green>Easy</font>| |
|
||
| 235 |[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/235.%Lowest%Common%Ancestor%of%a%Binary%Search%Tree.md)|<font color=green>Easy</font>| |
|
||
| 237 |[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/237.%Delete%Node%in%a%Linked%List.md)|<font color=green>Easy</font>| |
|
||
| 242 |[Valid Anagram](https://leetcode.com/problems/valid-anagram)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/242.%Valid%Anagram.md)|<font color=green>Easy</font>| |
|
||
| 257 |[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/257.%Binary%Tree%Paths.md)|<font color=green>Easy</font>| |
|
||
| 258 |[Add Digits](https://leetcode.com/problems/add-digits)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/258.%Add%Digits.md)|<font color=green>Easy</font>| |
|
||
| 263 |[Ugly Number](https://leetcode.com/problems/ugly-number)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/263.%Ugly%Number.md)|<font color=green>Easy</font>| |
|
||
| 268 |[Missing Number](https://leetcode.com/problems/missing-number)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/268.%Missing%Number.md)|<font color=green>Easy</font>| |
|
||
| 278 |[First Bad Version](https://leetcode.com/problems/first-bad-version)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/278.%First%Bad%Version.md)|<font color=green>Easy</font>| |
|
||
| 283 |[Move Zeroes](https://leetcode.com/problems/move-zeroes)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/283.%Move%Zeroes.md)|<font color=green>Easy</font>| |
|
||
| 290 |[Word Pattern](https://leetcode.com/problems/word-pattern)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/290.%Word%Pattern.md)|<font color=green>Easy</font>| |
|
||
| 292 |[Nim Game](https://leetcode.com/problems/nim-game)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/292.%Nim%Game.md)|<font color=green>Easy</font>| |
|
||
| 303 |[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/303.%Range%Sum%Query%-%Immutable.md)|<font color=green>Easy</font>| |
|
||
| 326 |[Power of Three](https://leetcode.com/problems/power-of-three)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/326.%Power%of%Three.md)|<font color=green>Easy</font>| |
|
||
| 342 |[Power of Four](https://leetcode.com/problems/power-of-four)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/342.%Power%of%Four.md)|<font color=green>Easy</font>| |
|
||
| 344 |[Reverse String](https://leetcode.com/problems/reverse-string)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/344.%Reverse%String.md)|<font color=green>Easy</font>| |
|
||
| 345 |[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/345.%Reverse%Vowels%of%a%String.md)|<font color=green>Easy</font>| |
|
||
| 349 |[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/349.%Intersection%of%Two%Arrays.md)|<font color=green>Easy</font>| |
|
||
| 350 |[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/350.%Intersection%of%Two%Arrays%II.md)|<font color=green>Easy</font>| |
|
||
| 367 |[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/367.%Valid%Perfect%Square.md)|<font color=green>Easy</font>| |
|
||
| 371 |[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/371.%Sum%of%Two%Integers.md)|<font color=green>Easy</font>| |
|
||
| 374 |[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/374.%Guess%Number%Higher%or%Lower.md)|<font color=green>Easy</font>| |
|
||
| 383 |[Ransom Note](https://leetcode.com/problems/ransom-note)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/383.%Ransom%Note.md)|<font color=green>Easy</font>| |
|
||
| 387 |[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/387.%First%Unique%Character%in%a%String.md)|<font color=green>Easy</font>| |
|
||
| 389 |[Find the Difference](https://leetcode.com/problems/find-the-difference)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/389.%Find%the%Difference.md)|<font color=green>Easy</font>| |
|
||
| 400 |[Nth Digit](https://leetcode.com/problems/nth-digit)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/400.%Nth%Digit.md)|<font color=green>Easy</font>| |
|
||
| 404 |[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/404.%Sum%of%Left%Leaves.md)|<font color=green>Easy</font>| |
|
||
| 405 |[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/405.%Convert%a%Number%to%Hexadecimal.md)|<font color=green>Easy</font>| |
|
||
| 409 |[Longest Palindrome](https://leetcode.com/problems/longest-palindrome)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/409.%Longest%Palindrome.md)|<font color=green>Easy</font>| |
|
||
| 414 |[Third Maximum Number](https://leetcode.com/problems/third-maximum-number)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/414.%Third%Maximum%Number.md)|<font color=green>Easy</font>| |
|
||
| 415 |[Add Strings](https://leetcode.com/problems/add-strings)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/415.%Add%Strings.md)|<font color=green>Easy</font>| |
|
||
| 429 |[N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/429.%N-ary%Tree%Level%Order%Traversal.md)|<font color=green>Easy</font>| |
|
||
| 434 |[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/434.%Number%of%Segments%in%a%String.md)|<font color=green>Easy</font>| |
|
||
| 437 |[Path Sum III](https://leetcode.com/problems/path-sum-iii)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/437.%Path%Sum%III.md)|<font color=green>Easy</font>| |
|
||
| 438 |[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/438.%Find%All%Anagrams%in%a%String.md)|<font color=green>Easy</font>| |
|
||
| 441 |[Arranging Coins](https://leetcode.com/problems/arranging-coins)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/441.%Arranging%Coins.md)|<font color=green>Easy</font>| |
|
||
| 443 |[String Compression](https://leetcode.com/problems/string-compression)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/443.%String%Compression.md)|<font color=green>Easy</font>| |
|
||
| 447 |[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/447.%Number%of%Boomerangs.md)|<font color=green>Easy</font>| |
|
||
| 448 |[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/448.%Find%All%Numbers%Disappeared%in%an%Array.md)|<font color=green>Easy</font>| |
|
||
| 453 |[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/453.%Minimum%Moves%to%Equal%Array%Elements.md)|<font color=green>Easy</font>| |
|
||
| 455 |[Assign Cookies](https://leetcode.com/problems/assign-cookies)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/455.%Assign%Cookies.md)|<font color=green>Easy</font>| |
|
||
| 459 |[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/459.%Repeated%Substring%Pattern.md)|<font color=green>Easy</font>| |
|
||
| 461 |[Hamming Distance](https://leetcode.com/problems/hamming-distance)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/461.%Hamming%Distance.md)|<font color=green>Easy</font>| |
|
||
| 463 |[Island Perimeter](https://leetcode.com/problems/island-perimeter)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/463.%Island%Perimeter.md)|<font color=green>Easy</font>| |
|
||
| 475 |[Heaters](https://leetcode.com/problems/heaters)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/475.%Heaters.md)|<font color=green>Easy</font>| |
|
||
| 476 |[Number Complement](https://leetcode.com/problems/number-complement)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/476.%Number%Complement.md)|<font color=green>Easy</font>| |
|
||
| 485 |[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/485.%Max%Consecutive%Ones.md)|<font color=green>Easy</font>| |
|
||
| 496 |[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/496.%Next%Greater%Element%I.md)|<font color=green>Easy</font>| |
|
||
| 500 |[Keyboard Row](https://leetcode.com/problems/keyboard-row)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/500.%Keyboard%Row.md)|<font color=green>Easy</font>| |
|
||
| 532 |[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/532.%K-diff%Pairs%in%an%Array.md)|<font color=green>Easy</font>| |
|
||
| 561 |[Array Partition I](https://leetcode.com/problems/array-partition-i)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/561.%Array%Partition%I.md)|<font color=green>Easy</font>| |
|
||
| 566 |[Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/566.%Reshape%the%Matrix.md)|<font color=green>Easy</font>| |
|
||
| 581 |[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/581.%Shortest%Unsorted%Continuous%Subarray.md)|<font color=green>Easy</font>| |
|
||
| 605 |[Can Place Flowers](https://leetcode.com/problems/can-place-flowers)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/605.%Can%Place%Flowers.md)|<font color=green>Easy</font>| |
|
||
| 628 |[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/628.%Maximum%Product%of%Three%Numbers.md)|<font color=green>Easy</font>| |
|
||
| 643 |[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/643.%Maximum%Average%Subarray%I.md)|<font color=green>Easy</font>| |
|
||
| 661 |[Image Smoother](https://leetcode.com/problems/image-smoother)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/661.%Image%Smoother.md)|<font color=green>Easy</font>| |
|
||
| 665 |[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/665.%Non-decreasing%Array.md)|<font color=green>Easy</font>| | |