feat: add sidebar and generate pagination

添加侧边栏，激活底部导航页

Author: yanglbme

index.html

@@ -32,6 +32,13 @@
       search: [
         '/','/solution/','/lcof/','lcci/'
       ],
+      loadSidebar: 'summary.md',
+      pagination: {
+        previousText: '上一题',
+        nextText: '下一题',
+        crossChapter: true,
+        crossChapterText: true
+      },
       // themeColor: '#25798A',
       darkMode: {
         light: {
@@ -83,5 +90,6 @@
   <script src="//unpkg.com/docsify/lib/plugins/emoji.js"></script>
   <script src="//unpkg.com/docsify/lib/plugins/zoom-image.js"></script>
   <script src="//unpkg.com/docsify-dark-mode@0.6.1/dist/index.js"></script>
+  <script src="//unpkg.com/docsify-pagination/dist/docsify-pagination.min.js"></script>
 </body>
 </html>

lcci/summary.md

@@ -0,0 +1,110 @@
+- 程序员面试金典题解
+    - [01.01.Is Unique](/lcci/01.01.Is%20Unique/README.md)
+    - [01.02.Check Permutation](/lcci/01.02.Check%20Permutation/README.md)
+    - [01.03.String to URL](/lcci/01.03.String%20to%20URL/README.md)
+    - [01.04.Palindrome Permutation](/lcci/01.04.Palindrome%20Permutation/README.md)
+    - [01.05.One Away](/lcci/01.05.One%20Away/README.md)
+    - [01.06.Compress String](/lcci/01.06.Compress%20String/README.md)
+    - [01.07.Rotate Matrix](/lcci/01.07.Rotate%20Matrix/README.md)
+    - [01.08.Zero Matrix](/lcci/01.08.Zero%20Matrix/README.md)
+    - [01.09.String Rotation](/lcci/01.09.String%20Rotation/README.md)
+    - [02.01.Remove Duplicate Node](/lcci/02.01.Remove%20Duplicate%20Node/README.md)
+    - [02.02.Kth Node From End of List](/lcci/02.02.Kth%20Node%20From%20End%20of%20List/README.md)
+    - [02.03.Delete Middle Node](/lcci/02.03.Delete%20Middle%20Node/README.md)
+    - [02.04.Partition List](/lcci/02.04.Partition%20List/README.md)
+    - [02.05.Sum Lists](/lcci/02.05.Sum%20Lists/README.md)
+    - [02.06.Palindrome Linked List](/lcci/02.06.Palindrome%20Linked%20List/README.md)
+    - [02.07.Intersection of Two Linked Lists](/lcci/02.07.Intersection%20of%20Two%20Linked%20Lists/README.md)
+    - [02.08.Linked List Cycle](/lcci/02.08.Linked%20List%20Cycle/README.md)
+    - [03.01.Three in One](/lcci/03.01.Three%20in%20One/README.md)
+    - [03.02.Min Stack](/lcci/03.02.Min%20Stack/README.md)
+    - [03.03.Stack of Plates](/lcci/03.03.Stack%20of%20Plates/README.md)
+    - [03.04.Implement Queue using Stacks](/lcci/03.04.Implement%20Queue%20using%20Stacks/README.md)
+    - [03.05.Sort of Stacks](/lcci/03.05.Sort%20of%20Stacks/README.md)
+    - [03.06.Animal Shelter](/lcci/03.06.Animal%20Shelter/README.md)
+    - [04.01.Route Between Nodes](/lcci/04.01.Route%20Between%20Nodes/README.md)
+    - [04.02.Minimum Height Tree](/lcci/04.02.Minimum%20Height%20Tree/README.md)
+    - [04.03.List of Depth](/lcci/04.03.List%20of%20Depth/README.md)
+    - [04.04.Check Balance](/lcci/04.04.Check%20Balance/README.md)
+    - [04.05.Legal Binary Search Tree](/lcci/04.05.Legal%20Binary%20Search%20Tree/README.md)
+    - [04.06.Successor](/lcci/04.06.Successor/README.md)
+    - [04.08.First Common Ancestor](/lcci/04.08.First%20Common%20Ancestor/README.md)
+    - [04.09.BST Sequences](/lcci/04.09.BST%20Sequences/README.md)
+    - [04.10.Check SubTree](/lcci/04.10.Check%20SubTree/README.md)
+    - [04.12.Paths with Sum](/lcci/04.12.Paths%20with%20Sum/README.md)
+    - [05.01.Insert Into Bits](/lcci/05.01.Insert%20Into%20Bits/README.md)
+    - [05.02.Bianry Number to String](/lcci/05.02.Bianry%20Number%20to%20String/README.md)
+    - [05.03.Reverse Bits](/lcci/05.03.Reverse%20Bits/README.md)
+    - [05.04.Closed Number](/lcci/05.04.Closed%20Number/README.md)
+    - [05.06.Convert Integer](/lcci/05.06.Convert%20Integer/README.md)
+    - [05.07.Exchange](/lcci/05.07.Exchange/README.md)
+    - [05.08.Draw Line](/lcci/05.08.Draw%20Line/README.md)
+    - [08.01.Three Steps Problem](/lcci/08.01.Three%20Steps%20Problem/README.md)
+    - [08.02.Robot in a Grid](/lcci/08.02.Robot%20in%20a%20Grid/README.md)
+    - [08.03.Magic Index](/lcci/08.03.Magic%20Index/README.md)
+    - [08.04.Power Set](/lcci/08.04.Power%20Set/README.md)
+    - [08.05.Recursive Mulitply](/lcci/08.05.Recursive%20Mulitply/README.md)
+    - [08.06.Hanota](/lcci/08.06.Hanota/README.md)
+    - [08.07.Permutation I](/lcci/08.07.Permutation%20I/README.md)
+    - [08.08.Permutation II](/lcci/08.08.Permutation%20II/README.md)
+    - [08.09.Bracket](/lcci/08.09.Bracket/README.md)
+    - [08.10.Color Fill](/lcci/08.10.Color%20Fill/README.md)
+    - [08.11.Coin](/lcci/08.11.Coin/README.md)
+    - [08.12.Eight Queens](/lcci/08.12.Eight%20Queens/README.md)
+    - [08.13.Pile Box](/lcci/08.13.Pile%20Box/README.md)
+    - [08.14.Boolean Evaluation](/lcci/08.14.Boolean%20Evaluation/README.md)
+    - [10.01.Sorted Merge](/lcci/10.01.Sorted%20Merge/README.md)
+    - [10.02.Group Anagrams](/lcci/10.02.Group%20Anagrams/README.md)
+    - [10.03.Search Rotate Array](/lcci/10.03.Search%20Rotate%20Array/README.md)
+    - [10.05.Sparse Array Search](/lcci/10.05.Sparse%20Array%20Search/README.md)
+    - [10.09.Sorted Matrix Search](/lcci/10.09.Sorted%20Matrix%20Search/README.md)
+    - [10.10.Rank from Stream](/lcci/10.10.Rank%20from%20Stream/README.md)
+    - [10.11.Peaks and Valleys](/lcci/10.11.Peaks%20and%20Valleys/README.md)
+    - [16.01.Swap Numbers](/lcci/16.01.Swap%20Numbers/README.md)
+    - [16.02.Words Frequency](/lcci/16.02.Words%20Frequency/README.md)
+    - [16.03.Intersection](/lcci/16.03.Intersection/README.md)
+    - [16.04.Tic-Tac-Toe](/lcci/16.04.Tic-Tac-Toe/README.md)
+    - [16.05.Factorial Zeros](/lcci/16.05.Factorial%20Zeros/README.md)
+    - [16.06.Smallest Difference](/lcci/16.06.Smallest%20Difference/README.md)
+    - [16.07.Maximum](/lcci/16.07.Maximum/README.md)
+    - [16.08.English Int](/lcci/16.08.English%20Int/README.md)
+    - [16.09.Operations](/lcci/16.09.Operations/README.md)
+    - [16.10.Living People](/lcci/16.10.Living%20People/README.md)
+    - [16.11.Diving Board](/lcci/16.11.Diving%20Board/README.md)
+    - [16.13.Bisect Squares](/lcci/16.13.Bisect%20Squares/README.md)
+    - [16.14.Best Line](/lcci/16.14.Best%20Line/README.md)
+    - [16.15.Master Mind](/lcci/16.15.Master%20Mind/README.md)
+    - [16.16.Sub Sort](/lcci/16.16.Sub%20Sort/README.md)
+    - [16.17.Contiguous Sequence](/lcci/16.17.Contiguous%20Sequence/README.md)
+    - [16.18.Pattern Matching](/lcci/16.18.Pattern%20Matching/README.md)
+    - [16.19.Pond Sizes](/lcci/16.19.Pond%20Sizes/README.md)
+    - [16.20.T9](/lcci/16.20.T9/README.md)
+    - [16.21.Sum Swap](/lcci/16.21.Sum%20Swap/README.md)
+    - [16.22.Langtons Ant](/lcci/16.22.Langtons%20Ant/README.md)
+    - [16.24.Pairs With Sum](/lcci/16.24.Pairs%20With%20Sum/README.md)
+    - [16.25.LRU Cache](/lcci/16.25.LRU%20Cache/README.md)
+    - [16.26.Calculator](/lcci/16.26.Calculator/README.md)
+    - [17.01.Add Without Plus](/lcci/17.01.Add%20Without%20Plus/README.md)
+    - [17.04.Missing Number](/lcci/17.04.Missing%20Number/README.md)
+    - [17.05.Find Longest Subarray](/lcci/17.05.Find%20Longest%20Subarray/README.md)
+    - [17.06.Number Of 2s In Range](/lcci/17.06.Number%20Of%202s%20In%20Range/README.md)
+    - [17.07.Baby Names](/lcci/17.07.Baby%20Names/README.md)
+    - [17.08.Circus Tower](/lcci/17.08.Circus%20Tower/README.md)
+    - [17.09.Get Kth Magic Number](/lcci/17.09.Get%20Kth%20Magic%20Number/README.md)
+    - [17.10.Find Majority Element](/lcci/17.10.Find%20Majority%20Element/README.md)
+    - [17.11.Find Closest](/lcci/17.11.Find%20Closest/README.md)
+    - [17.12.BiNode](/lcci/17.12.BiNode/README.md)
+    - [17.13.Re-Space](/lcci/17.13.Re-Space/README.md)
+    - [17.14.Smallest K](/lcci/17.14.Smallest%20K/README.md)
+    - [17.15.Longest Word](/lcci/17.15.Longest%20Word/README.md)
+    - [17.16.The Masseuse](/lcci/17.16.The%20Masseuse/README.md)
+    - [17.17.Multi Search](/lcci/17.17.Multi%20Search/README.md)
+    - [17.18.Shortest Supersequence](/lcci/17.18.Shortest%20Supersequence/README.md)
+    - [17.19.Missing Two](/lcci/17.19.Missing%20Two/README.md)
+    - [17.20.Continuous Median](/lcci/17.20.Continuous%20Median/README.md)
+    - [17.21.Volume of Histogram](/lcci/17.21.Volume%20of%20Histogram/README.md)
+    - [17.22.Word Transformer](/lcci/17.22.Word%20Transformer/README.md)
+    - [17.23.Max Black Square](/lcci/17.23.Max%20Black%20Square/README.md)
+    - [17.24.Max Submatrix](/lcci/17.24.Max%20Submatrix/README.md)
+    - [17.25.Word Rectangle](/lcci/17.25.Word%20Rectangle/README.md)
+    - [17.26.Sparse Similarity](/lcci/17.26.Sparse%20Similarity/README.md)

lcof/summary.md

@@ -0,0 +1,61 @@
+- 剑指 Offer 题解
+    - [03. 数组中重复的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9803.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
+    - [04. 二维数组中的查找](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9804.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE/README.md)
+    - [05. 替换空格](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9805.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC/README.md)
+    - [06. 从尾到头打印链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9806.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8/README.md)
+    - [07. 重建二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9807.%20%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
+    - [09. 用两个栈实现队列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9809.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97/README.md)
+    - [10- I. 斐波那契数列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20I.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97/README.md)
+    - [10- II. 青蛙跳台阶问题](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20II.%20%E9%9D%92%E8%9B%99%E8%B7%B3%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98/README.md)
+    - [11. 旋转数组的最小数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9811.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97/README.md)
+    - [12. 矩阵中的路径](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9812.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84/README.md)
+    - [13. 机器人的运动范围](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9813.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4/README.md)
+    - [14- I. 剪绳子](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20I.%20%E5%89%AA%E7%BB%B3%E5%AD%90/README.md)
+    - [14- II. 剪绳子 II](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20II.%20%E5%89%AA%E7%BB%B3%E5%AD%90%20II/README.md)
+    - [15. 二进制中1的个数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9815.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0/README.md)
+    - [16. 数值的整数次方](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9816.%20%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9/README.md)
+    - [17. 打印从1到最大的n位数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9817.%20%E6%89%93%E5%8D%B0%E4%BB%8E1%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84n%E4%BD%8D%E6%95%B0/README.md)
+    - [18. 删除链表的节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9818.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E8%8A%82%E7%82%B9/README.md)
+    - [19. 正则表达式匹配](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9819.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D/README.md)
+    - [21. 调整数组顺序使奇数位于偶数前面](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9821.%20%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2/README.md)
+    - [22. 链表中倒数第k个节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9822.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9/README.md)
+    - [24. 反转链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9824.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8/README.md)
+    - [25. 合并两个排序的链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9825.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8/README.md)
+    - [26. 树的子结构](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9826.%20%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84/README.md)
+    - [27. 二叉树的镜像](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9827.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F/README.md)
+    - [28. 对称的二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9828.%20%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
+    - [29. 顺时针打印矩阵](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9829.%20%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5/README.md)
+    - [30. 包含min函数的栈](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9830.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88/README.md)
+    - [31. 栈的压入、弹出序列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9831.%20%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E3%80%81%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97/README.md)
+    - [32 - I. 从上到下打印二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20I.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
+    - [32 - II. 从上到下打印二叉树 II](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20II.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20II/README.md)
+    - [32 - III. 从上到下打印二叉树 III](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III/README.md)
+    - [33. 二叉搜索树的后序遍历序列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9833.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97/README.md)
+    - [34. 二叉树中和为某一值的路径](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9834.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%92%8C%E4%B8%BA%E6%9F%90%E4%B8%80%E5%80%BC%E7%9A%84%E8%B7%AF%E5%BE%84/README.md)
+    - [35. 复杂链表的复制](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9835.%20%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6/README.md)
+    - [39. 数组中出现次数超过一半的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9839.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%87%E4%B8%80%E5%8D%8A%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
+    - [40. 最小的k个数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9840.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0/README.md)
+    - [42. 连续子数组的最大和](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9842.%20%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C/README.md)
+    - [45. 把数组排成最小的数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9845.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0/README.md)
+    - [47. 礼物的最大价值](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9847.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC/README.md)
+    - [48. 最长不含重复字符的子字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9848.%20%E6%9C%80%E9%95%BF%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
+    - [49. 丑数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9849.%20%E4%B8%91%E6%95%B0/README.md)
+    - [50. 第一个只出现一次的字符](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9850.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6/README.md)
+    - [51. 数组中的逆序对](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9851.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9/README.md)
+    - [52. 两个链表的第一个公共节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9852.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%85%AC%E5%85%B1%E8%8A%82%E7%82%B9/README.md)
+    - [53 - I. 在排序数组中查找数字 I](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20I.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E6%95%B0%E5%AD%97%20I/README.md)
+    - [53 - II. 0～n-1中缺失的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20II.%200%EF%BD%9En-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
+    - [54. 二叉搜索树的第k大节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9854.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9/README.md)
+    - [55 - I. 二叉树的深度](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6/README.md)
+    - [55 - II. 平衡二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
+    - [56 - I. 数组中数字出现的次数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20I.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0/README.md)
+    - [56 - II. 数组中数字出现的次数 II](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20II.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0%20II/README.md)
+    - [57 - II. 和为s的连续正数序列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857%20-%20II.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%AD%A3%E6%95%B0%E5%BA%8F%E5%88%97/README.md)
+    - [57. 和为s的两个数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97/README.md)
+    - [58 - I. 翻转单词顺序](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20I.%20%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F/README.md)
+    - [58 - II. 左旋转字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20II.%20%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
+    - [63. 股票的最大利润](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9863.%20%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6/README.md)
+    - [64. 求1+2+…+n](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9864.%20%E6%B1%821%2B2%2B%E2%80%A6%2Bn/README.md)
+    - [67. 把字符串转换成整数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9867.%20%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%88%90%E6%95%B4%E6%95%B0/README.md)
+    - [68 - I. 二叉搜索树的最近公共祖先](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/README.md)
+    - [68 - II. 二叉树的最近公共祖先](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20II.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/README.md)

solution/summary.md

@@ -0,0 +1,4 @@
+- 题解速览
+    - [LeetCode（未完）](/solution/README.md)
+    - [剑指 Offer（第 2 版）](/lcof/README.md)
+    - [程序员面试金典（第 6 版）](/lcci/README.md)