updat README.md

Author: zongyanqi

README.md

@@ -1,83 +1,3 @@
 # LeetCode in Javascript
 
-用 JS 刷 [LeetCode](https://leetcode.com/)
-
-
-+ [001-Two-Sum](./001-Two-Sum.js)
-+ [002-Add-Two-Numbers](./002-Add-Two-Numbers.js)
-+ [003-Longest-Substring-Without-Repeating-Characters](./003-Longest-Substring-Without-Repeating-Characters.js)
-+ [004-Median-of-Two-Sorted-Arrays](./004-Median-of-Two-Sorted-Arrays.js)
-+ [005-Longest-Palindromic-Substring](./005-Longest-Palindromic-Substring.js)
-+ [011-Container-With-Most-Water](./011-Container-With-Most-Water.js)
-+ [014-Longest-Common-Prefix](./014-Longest-Common-Prefix.js)
-+ [015-3Sum](./015-3Sum.js)
-+ [020-Valid-Parentheses](./020-Valid-Parentheses.js)
-+ [021-Merge-Two-Sorted-Lists](./021-Merge-Two-Sorted-Lists.js)
-+ [026-Remove-Duplicates-from-Sorted-Array](./026-Remove-Duplicates-from-Sorted-Array.js)
-+ [035-Search-Insert-Position](./035-Search-Insert-Position.js)
-+ [041-First-Missing-Positive](./041-First-Missing-Positive.js)
-+ [053-Maximum-Subarray](./053-Maximum-Subarray.js)
-+ [062-Unique-Paths](./062-Unique-Paths.js)
-+ [063-Unique-Paths-II](./063-Unique-Paths-II.js)
-+ [064-Minimum-Path-Sum](./064-Minimum-Path-Sum.js)
-+ [070-Climbing-Stairs](./070-Climbing-Stairs.js)
-+ [083-Remove-Duplicates-from-Sorted-List](./083-Remove-Duplicates-from-Sorted-List.js)
-+ [085-Maximal-Rectangle](./085-Maximal-Rectangle.js)
-+ [091-Decode-Ways](./091-Decode-Ways.js)
-+ [095-Unique-Binary-Search-Trees-II](./095-Unique-Binary-Search-Trees-II.js)
-+ [096-Unique-Binary-Search-Trees](./096-Unique-Binary-Search-Trees.js)
-+ [100-Same-Tree](./100-Same-Tree.js)
-+ [111-Minimum-Depth-of-Binary-Tree](./111-Minimum-Depth-of-Binary-Tree.js)
-+ [120-Triangle](./120-Triangle.js)
-+ [121-Best-Time-to-Buy-and-Sell-Stock](./121-Best-Time-to-Buy-and-Sell-Stock.js)
-+ [136-Single-Number](./136-Single-Number.js)
-+ [138.-Copy-List-with-Random-Pointer](./138.-Copy-List-with-Random-Pointer.js)
-+ [139-Word-Break](./139-Word-Break.js)
-+ [151-Reverse-Words-in-a-String](./151-Reverse-Words-in-a-String.js)
-+ [152-Maximum-Product-Subarray](./152-Maximum-Product-Subarray.js)
-+ [162-Find-Peak-Element](./162.-Find-Peak-Element.js)
-+ [167-Two-Sum-II-Input-array-is-sorted](./167-Two-Sum-II-Input-array-is-sorted.js)
-+ [171-Excel-Sheet-Column-Number](./171-Excel-Sheet-Column-Number.js)
-+ [190-Reverse-Bits](./190-Reverse-Bits.js)
-+ [191-Number-of-1-Bits](./191-Number-of-1-Bits.js)
-+ [198-House-Robber](./198.-House-Robber.js)
-+ [202-Happy-Number](./202-Happy-Number.js)
-+ [204-Count-Primes](./204-Count-Primes.js)
-+ [217-Contains-Duplicate](./217-Contains-Duplicate.js)
-+ [226-Invert-Binary-Tree](./226-Invert-Binary-Tree.js)
-+ [227-Basic-Calculator-II](./227-Basic-Calculator-II.js)
-+ [258-Add-Digits](./258-Add-Digits.js)
-+ [263-Ugly-Number](./263-Ugly-Number.js)
-+ [268-Missing-Number](./268-Missing-Number.js)
-+ [283-Move-Zeroes](./283-Move-Zeroes.js)
-+ [300-Longest-Increasing-Subsequence](./300-Longest-Increasing-Subsequence.js)
-+ [349-Intersection-of-Two-Arrays](./349-Intersection-of-Two-Arrays.js)
-+ [383-Ransom-Note](./383-Ransom-Note.js)
-+ [387-First-Unique-Character-in-a-String](./387-First-Unique-Character-in-a-String.js)
-+ [392-Is-Subsequence](./392-Is-Subsequence.js)
-+ [404-Sum-of-Left-Leaves](./404-Sum-of-Left-Leaves.js)
-+ [413-Arithmetic-Slices](./413-Arithmetic-Slices.js)
-+ [415-Add-Strings](./415-Add-Strings.js)
-+ [416-Partition-Equal-Subset-Sum](./416-Partition-Equal-Subset-Sum.js)
-+ [447-Number-of-Boomerangs](./447-Number-of-Boomerangs.js)
-+ [453-Minimum-Moves-to-Equal-Array-Elements](./453-Minimum-Moves-to-Equal-Array-Elements.js)
-+ [448-Find-All-Numbers-Disappeared-in-an-Array](./448-Find-All-Numbers-Disappeared-in-an-Array.js)
-+ [454-4Sum-II](./454-4Sum-II.js)
-+ [455-Assign-Cookies](./455-Assign-Cookies.js)
-+ [461-Hamming-Distance](./461-Hamming-Distance.js)
-+ [476-Number-Complement](./476-Number-Complement.js)
-+ [477-Total-Hamming-Distance](./477-Total-Hamming-Distance.js)
-+ [492-Construct-the-Rectangle](./492-Construct-the-Rectangle.js)
-+ [504-Base-7](./504-Base-7.js)
-+ [506-Relative-Ranks](./506-Relative-Ranks.js)
-+ [520-Detect-Capital](./520-Detect-Capital.js)
-+ [523-Continuous-Subarray-Sum](./523-Continuous-Subarray-Sum.js)
-+ [646-Maximum-Length-of-Pair-Chain](./646-Maximum-Length-of-Pair-Chain.js)
-+ [657-Judge-Route-Circle](./657-Judge-Route-Circle.js)
-+ [673-Number-of-Longest-Increasing-Subsequence](./673-Number-of-Longest-Increasing-Subsequence.js)
-+ [693-Binary-Number-with-Alternating-Bits](./693-Binary-Number-with-Alternating-Bits.js)
-+ [695-Max-Area-of-Island](./695-Max-Area-of-Island.js)
-+ 背包问题
-    - [01 背包问题](./pack/01.js)
-    - [02 完全背包问题](./pack/02.js)
-    - [03 多重背包问题](./pack/03.js)
+一起来刷 [LeetCode](https://leetcode.com/) :D