Skip to content

Commit 630fbed

Browse files
author
haolin3
committed
调整目录
1 parent 3d1fd7d commit 630fbed

File tree

1 file changed

+66
-66
lines changed

1 file changed

+66
-66
lines changed

‎README.md

Lines changed: 66 additions & 66 deletions
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ English version repo and Gitbook is on [english branch](https://github.com/geekx
2727
| 🚀：[大厂面经汇总指南](https://github.com/geekxh/hello-algorithm/tree/master/%E5%A4%A7%E5%8E%82%E9%9D%A2%E7%BB%8F%E6%B1%87%E6%80%BB100%E7%AF%87) | [java](https://github.com/geekxh/hello-algorithm/tree/master/%E5%A4%A7%E5%8E%82%E9%9D%A2%E7%BB%8F%E6%B1%87%E6%80%BB100%E7%AF%87/Java) | [python](https://github.com/geekxh/hello-algorithm/tree/master/%E5%A4%A7%E5%8E%82%E9%9D%A2%E7%BB%8F%E6%B1%87%E6%80%BB100%E7%AF%87/Python) | [前端](https://github.com/geekxh/hello-algorithm/tree/master/%E5%A4%A7%E5%8E%82%E9%9D%A2%E7%BB%8F%E6%B1%87%E6%80%BB100%E7%AF%87/%E5%89%8D%E7%AB%AF) |
2828
| 🐒：[超清思维导图集锦](https://github.com/geekxh/hello-algorithm/tree/master/%E8%B6%85%E6%B8%85%E6%80%9D%E7%BB%B4%E5%AF%BC%E5%9B%BE100%E5%BC%A0) | | | |
2929
| 📚：[超清电子书一千本](https://github.com/geekxh/hello-algorithm/tree/master/%E6%B8%85%E6%99%B0%E7%89%88%E7%94%B5%E5%AD%90%E4%B9%A61000%E6%9C%AC) | | | |
30-
| 💯：[专栏：剑指offer系列](https://github.com/geekxh/hello-algorithm/tree/master/%E9%98%85%E8%AF%BB_%E5%89%91%E6%8C%87offer)| | | |
30+
| 💯：[专栏：剑指offer](https://github.com/geekxh/hello-algorithm/tree/master/%E4%B8%93%E6%A0%8F/%E5%89%91%E6%8C%87offer)| | | |
3131

3232

3333
### 使用指南
@@ -208,68 +208,68 @@ English version repo and Gitbook is on [english branch](https://github.com/geekx
208208

209209
| Title | 学习地址 |
210210
|---|---|
211-
| 01、找出数组中重复的数字 | [Find Duplication In Array](./阅读_剑指offer/03_01_DuplicationInArray) |
212-
| 02、找出数组中重复的数字II | [Find Duplication In Array II](./阅读_剑指offer/03_02_DuplicationInArrayNoEdit) |
213-
| 03、二维数组中的查找 | [Find In Partially Sorted Matrix](./阅读_剑指offer/04_FindInPartiallySortedMatrix) |
214-
| 04、将字符串中的所有空格替换为%20 | [Replace Spaces](./阅读_剑指offer/05_ReplaceSpaces) |
215-
| 05、从尾到头打印链表 | [Print List In Reversed Order](./阅读_剑指offer/06_PrintListInReversedOrder) |
216-
| 06、重建二叉树 | [Construct Binary Tree](./阅读_剑指offer/07_ConstructBinaryTree) |
217-
| 07、二叉树的下一个结点 | [Next Node In Binary Trees](./阅读_剑指offer/08_NextNodeInBinaryTrees) |
218-
| 08、用两个栈实现队列 | [Queue With Two Stacks](./阅读_剑指offer/09_01_QueueWithTwoStacks) |
219-
| 09、用两个队列实现栈 | [Stack With Two Queues](./阅读_剑指offer/09_02_StackWithTwoQueues) |
220-
| 10、斐波那契数列 | [Fibonacci](./阅读_剑指offer/10_01_Fibonacci) |
221-
| 11、跳台阶 | [Jump Floor](./阅读_剑指offer/10_02_JumpFloor) |
222-
| 12、变态跳台阶 | [Jump Floor II](./阅读_剑指offer/10_03_JumpFloorII) |
223-
| 13、矩形覆盖 | [Rect Cover](./阅读_剑指offer/10_04_RectCover) |
224-
| 14、旋转数组的最小数字 | [Min Number In Rotated Array](./阅读_剑指offer/11_MinNumberInRotatedArray) |
225-
| 15、矩阵中的路径 | [String Path In Matrix](./阅读_剑指offer/12_StringPathInMatrix) |
226-
| 16、机器人的移动范围 | [Robot Move](./阅读_剑指offer/13_RobotMove) |
227-
| 17、剪绳子求最大乘积 | [Cutting Rope](./阅读_剑指offer/14_CuttingRope) |
228-
| 18、二进制中 1 的个数 | [Number Of 1 In Binary](./阅读_剑指offer/15_NumberOf1InBinary) |
229-
| 19、数值的整数次方 | [Power](./阅读_剑指offer/16_Power) |
230-
| 20、打印从 1 到最大的 n 位数 | [Print 1 To Max Of N Digits](./阅读_剑指offer/17_Print1ToMaxOfNDigits) |
231-
| 21、在O(1)时间内删除链表节点 | [Delete Node In List](./阅读_剑指offer/18_01_DeleteNodeInList) |
232-
| 22、删除链表中重复的节点 | [Delete Duplicated Node](./阅读_剑指offer/18_02_DeleteDuplicatedNode) |
233-
| 23、正则表达式匹配 | [Regular Expressions Matching](./阅读_剑指offer/19_RegularExpressionsMatching) |
234-
| 24、表示数值的字符串 | [Numeric Strings](./阅读_剑指offer/20_NumericStrings) |
235-
| 25、调整数组顺序使奇数位于偶数前面 | [Reorder Array](./阅读_剑指offer/21_ReorderArray) |
236-
| 26、链表中倒数第k个结点 | [Kth Node From End](./阅读_剑指offer/22_KthNodeFromEnd) |
237-
| 27、链表中环的入口结点 | [Entry Node In List Loop](./阅读_剑指offer/23_EntryNodeInListLoop) |
238-
| 28、反转链表 | [Reverse List](./阅读_剑指offer/24_ReverseList) |
239-
| 29、合并两个排序的链表 | [Merge Sorted Lists](./阅读_剑指offer/25_MergeSortedLists) |
240-
| 30、树的子结构 | [Substructure In Tree](./阅读_剑指offer/26_SubstructureInTree) |
241-
| 31、二叉树的镜像 | [Mirror Of Binary Tree](./阅读_剑指offer/27_MirrorOfBinaryTree) |
242-
| 32、对称的二叉树 | [Symmetrical Binary Tree](./阅读_剑指offer/28_SymmetricalBinaryTree) |
243-
| 33、顺时针打印矩阵 | [Print Matrix](./阅读_剑指offer/29_PrintMatrix) |
244-
| 34、包含min函数的栈 | [Min In Stack](./阅读_剑指offer/30_MinInStack) |
245-
| 35、栈的压入、弹出序列 | [Stack Push Pop Order](./阅读_剑指offer/31_StackPushPopOrder) |
246-
| 36、不分行从上到下打印二叉树 | [Print Tree From Top To Bottom](./阅读_剑指offer/32_01_PrintTreeFromTopToBottom) |
247-
| 37、把二叉树打印成多行 | [Print Trees In Lines](./阅读_剑指offer/32_02_PrintTreesInLines) |
248-
| 38、按之字形打印二叉树 | [Print Trees In Zigzag](./阅读_剑指offer/32_03_PrintTreesInZigzag) |
249-
| 39、二叉搜索树的后序遍历序列 | [Squence Of BST](./阅读_剑指offer/33_SquenceOfBST) |
250-
| 40、二叉树中和为某一值的路径 | [Path In Tree](./阅读_剑指offer/34_PathInTree) |
251-
| 41、复杂链表的复制 | [Copy Complex List](./阅读_剑指offer/35_CopyComplexList) |
252-
| 42、二叉搜索树与双向链表 | [Convert Binary Search Tree](./阅读_剑指offer/36_ConvertBinarySearchTree) |
253-
| 43、数组中出现次数超过一半的数字 | [More Than Half Number](./阅读_剑指offer/39_MoreThanHalfNumber) |
254-
| 44、获取数组中最小的k个数 | [K Least Numbers](./阅读_剑指offer/40_KLeastNumbers) |
255-
| 45、数据流中的中位数 | [Stream Median](./阅读_剑指offer/41_StreamMedian) |
256-
| 46、连续子数组的最大和 | [Greatest Sum Of Subarrays](./阅读_剑指offer/42_GreatestSumOfSubarrays) |
257-
| 47、数字序列中某一位的数字 | [Digits In Sequence](./阅读_剑指offer/44_DigitsInSequence) |
258-
| 48、把数组排成最小的数 | [Sort Array For Min Number](./阅读_剑指offer/45_SortArrayForMinNumber) |
259-
| 49、把数字翻译成字符串 | [Translate Numbers To Strings](./阅读_剑指offer/46_TranslateNumbersToStrings) |
260-
| 50、礼物的最大价值 | [Max Value Of Gifts](./阅读_剑指offer/47_MaxValueOfGifts) |
261-
| 51、最长不含重复字符的子字符串 | [Longest Substring Without Dup](./阅读_剑指offer/48_LongestSubstringWithoutDup) |
262-
| 52、两个链表的第一个公共结点 | [First Common Nodes In Lists](./阅读_剑指offer/52_FirstCommonNodesInLists) |
263-
| 53、数字在排序数组中出现的次数 | [Number Of K](./阅读_剑指offer/53_01_NumberOfK) |
264-
| 54、0到n-1中缺失的数字| [Missing Number](./阅读_剑指offer/53_02_MissingNumber) |
265-
| 55、数组中数值和下标相等的元素 | [Integer Identical To Index](./阅读_剑指offer/53_03_IntegerIdenticalToIndex) |
266-
| 56、二叉树的深度 | [Tree Depth](./阅读_剑指offer/55_01_TreeDepth) |
267-
| 57、平衡二叉树 | [Balanced Binary Tree](./阅读_剑指offer/55_02_BalancedBinaryTree) |
268-
| 58、数组中只出现一次的两个数字 | [Numbers Appear Once](./阅读_剑指offer/56_01_NumbersAppearOnce) |
269-
| 59、数组中唯一只出现一次的数字 | [Number Appearing Once](./阅读_剑指offer/56_02_NumberAppearingOnce) |
270-
| 60、和为S的两个数字 | [Two Numbers With Sum](./阅读_剑指offer/57_01_TwoNumbersWithSum) |
271-
| 61、和为S的连续正数序列 | [Continuous Squence With Sum](./阅读_剑指offer/57_02_ContinuousSquenceWithSum) |
272-
| 62、翻转单词顺序 | [Reverse Words In Sentence](./阅读_剑指offer/58_01_ReverseWordsInSentence) |
273-
| 63、左旋转字符串 | [Left Rotate String](./阅读_剑指offer/58_02_LeftRotateString) |
274-
| 64、滑动窗口的最大值 | [Max In Sliding Window](./阅读_剑指offer/59_01_MaxInSlidingWindow) |
275-
| 65、扑克牌的顺子 | [Continous Cards](./阅读_剑指offer/61_ContinousCards) |
211+
| 01、找出数组中重复的数字 | [Find Duplication In Array](./专栏/剑指offer/03_01_DuplicationInArray) |
212+
| 02、找出数组中重复的数字II | [Find Duplication In Array II](./专栏/剑指offer/03_02_DuplicationInArrayNoEdit) |
213+
| 03、二维数组中的查找 | [Find In Partially Sorted Matrix](./专栏/剑指offer/04_FindInPartiallySortedMatrix) |
214+
| 04、将字符串中的所有空格替换为%20 | [Replace Spaces](./专栏/剑指offer/05_ReplaceSpaces) |
215+
| 05、从尾到头打印链表 | [Print List In Reversed Order](./专栏/剑指offer/06_PrintListInReversedOrder) |
216+
| 06、重建二叉树 | [Construct Binary Tree](./专栏/剑指offer/07_ConstructBinaryTree) |
217+
| 07、二叉树的下一个结点 | [Next Node In Binary Trees](./专栏/剑指offer/08_NextNodeInBinaryTrees) |
218+
| 08、用两个栈实现队列 | [Queue With Two Stacks](./专栏/剑指offer/09_01_QueueWithTwoStacks) |
219+
| 09、用两个队列实现栈 | [Stack With Two Queues](./专栏/剑指offer/09_02_StackWithTwoQueues) |
220+
| 10、斐波那契数列 | [Fibonacci](./专栏/剑指offer/10_01_Fibonacci) |
221+
| 11、跳台阶 | [Jump Floor](./专栏/剑指offer/10_02_JumpFloor) |
222+
| 12、变态跳台阶 | [Jump Floor II](./专栏/剑指offer/10_03_JumpFloorII) |
223+
| 13、矩形覆盖 | [Rect Cover](./专栏/剑指offer/10_04_RectCover) |
224+
| 14、旋转数组的最小数字 | [Min Number In Rotated Array](./专栏/剑指offer/11_MinNumberInRotatedArray) |
225+
| 15、矩阵中的路径 | [String Path In Matrix](./专栏/剑指offer/12_StringPathInMatrix) |
226+
| 16、机器人的移动范围 | [Robot Move](./专栏/剑指offer/13_RobotMove) |
227+
| 17、剪绳子求最大乘积 | [Cutting Rope](./专栏/剑指offer/14_CuttingRope) |
228+
| 18、二进制中 1 的个数 | [Number Of 1 In Binary](./专栏/剑指offer/15_NumberOf1InBinary) |
229+
| 19、数值的整数次方 | [Power](./专栏/剑指offer/16_Power) |
230+
| 20、打印从 1 到最大的 n 位数 | [Print 1 To Max Of N Digits](./专栏/剑指offer/17_Print1ToMaxOfNDigits) |
231+
| 21、在O(1)时间内删除链表节点 | [Delete Node In List](./专栏/剑指offer/18_01_DeleteNodeInList) |
232+
| 22、删除链表中重复的节点 | [Delete Duplicated Node](./专栏/剑指offer/18_02_DeleteDuplicatedNode) |
233+
| 23、正则表达式匹配 | [Regular Expressions Matching](./专栏/剑指offer/19_RegularExpressionsMatching) |
234+
| 24、表示数值的字符串 | [Numeric Strings](./专栏/剑指offer/20_NumericStrings) |
235+
| 25、调整数组顺序使奇数位于偶数前面 | [Reorder Array](./专栏/剑指offer/21_ReorderArray) |
236+
| 26、链表中倒数第k个结点 | [Kth Node From End](./专栏/剑指offer/22_KthNodeFromEnd) |
237+
| 27、链表中环的入口结点 | [Entry Node In List Loop](./专栏/剑指offer/23_EntryNodeInListLoop) |
238+
| 28、反转链表 | [Reverse List](./专栏/剑指offer/24_ReverseList) |
239+
| 29、合并两个排序的链表 | [Merge Sorted Lists](./专栏/剑指offer/25_MergeSortedLists) |
240+
| 30、树的子结构 | [Substructure In Tree](./专栏/剑指offer/26_SubstructureInTree) |
241+
| 31、二叉树的镜像 | [Mirror Of Binary Tree](./专栏/剑指offer/27_MirrorOfBinaryTree) |
242+
| 32、对称的二叉树 | [Symmetrical Binary Tree](./专栏/剑指offer/28_SymmetricalBinaryTree) |
243+
| 33、顺时针打印矩阵 | [Print Matrix](./专栏/剑指offer/29_PrintMatrix) |
244+
| 34、包含min函数的栈 | [Min In Stack](./专栏/剑指offer/30_MinInStack) |
245+
| 35、栈的压入、弹出序列 | [Stack Push Pop Order](./专栏/剑指offer/31_StackPushPopOrder) |
246+
| 36、不分行从上到下打印二叉树 | [Print Tree From Top To Bottom](./专栏/剑指offer/32_01_PrintTreeFromTopToBottom) |
247+
| 37、把二叉树打印成多行 | [Print Trees In Lines](./专栏/剑指offer/32_02_PrintTreesInLines) |
248+
| 38、按之字形打印二叉树 | [Print Trees In Zigzag](./专栏/剑指offer/32_03_PrintTreesInZigzag) |
249+
| 39、二叉搜索树的后序遍历序列 | [Squence Of BST](./专栏/剑指offer/33_SquenceOfBST) |
250+
| 40、二叉树中和为某一值的路径 | [Path In Tree](./专栏/剑指offer/34_PathInTree) |
251+
| 41、复杂链表的复制 | [Copy Complex List](./专栏/剑指offer/35_CopyComplexList) |
252+
| 42、二叉搜索树与双向链表 | [Convert Binary Search Tree](./专栏/剑指offer/36_ConvertBinarySearchTree) |
253+
| 43、数组中出现次数超过一半的数字 | [More Than Half Number](./专栏/剑指offer/39_MoreThanHalfNumber) |
254+
| 44、获取数组中最小的k个数 | [K Least Numbers](./专栏/剑指offer/40_KLeastNumbers) |
255+
| 45、数据流中的中位数 | [Stream Median](./专栏/剑指offer/41_StreamMedian) |
256+
| 46、连续子数组的最大和 | [Greatest Sum Of Subarrays](./专栏/剑指offer/42_GreatestSumOfSubarrays) |
257+
| 47、数字序列中某一位的数字 | [Digits In Sequence](./专栏/剑指offer/44_DigitsInSequence) |
258+
| 48、把数组排成最小的数 | [Sort Array For Min Number](./专栏/剑指offer/45_SortArrayForMinNumber) |
259+
| 49、把数字翻译成字符串 | [Translate Numbers To Strings](./专栏/剑指offer/46_TranslateNumbersToStrings) |
260+
| 50、礼物的最大价值 | [Max Value Of Gifts](./专栏/剑指offer/47_MaxValueOfGifts) |
261+
| 51、最长不含重复字符的子字符串 | [Longest Substring Without Dup](./专栏/剑指offer/48_LongestSubstringWithoutDup) |
262+
| 52、两个链表的第一个公共结点 | [First Common Nodes In Lists](./专栏/剑指offer/52_FirstCommonNodesInLists) |
263+
| 53、数字在排序数组中出现的次数 | [Number Of K](./专栏/剑指offer/53_01_NumberOfK) |
264+
| 54、0到n-1中缺失的数字| [Missing Number](./专栏/剑指offer/53_02_MissingNumber) |
265+
| 55、数组中数值和下标相等的元素 | [Integer Identical To Index](./专栏/剑指offer/53_03_IntegerIdenticalToIndex) |
266+
| 56、二叉树的深度 | [Tree Depth](./专栏/剑指offer/55_01_TreeDepth) |
267+
| 57、平衡二叉树 | [Balanced Binary Tree](./专栏/剑指offer/55_02_BalancedBinaryTree) |
268+
| 58、数组中只出现一次的两个数字 | [Numbers Appear Once](./专栏/剑指offer/56_01_NumbersAppearOnce) |
269+
| 59、数组中唯一只出现一次的数字 | [Number Appearing Once](./专栏/剑指offer/56_02_NumberAppearingOnce) |
270+
| 60、和为S的两个数字 | [Two Numbers With Sum](./专栏/剑指offer/57_01_TwoNumbersWithSum) |
271+
| 61、和为S的连续正数序列 | [Continuous Squence With Sum](./专栏/剑指offer/57_02_ContinuousSquenceWithSum) |
272+
| 62、翻转单词顺序 | [Reverse Words In Sentence](./专栏/剑指offer/58_01_ReverseWordsInSentence) |
273+
| 63、左旋转字符串 | [Left Rotate String](./专栏/剑指offer/58_02_LeftRotateString) |
274+
| 64、滑动窗口的最大值 | [Max In Sliding Window](./专栏/剑指offer/59_01_MaxInSlidingWindow) |
275+
| 65、扑克牌的顺子 | [Continous Cards](./专栏/剑指offer/61_ContinousCards) |

0 commit comments

Comments
 (0)