tcandzq / coding-interviews Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

《剑指Offer-名企面试官精讲典型编程题》第2版 C++实现

2 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 39 Commits
.vscode		.vscode
03_01_DuplicationInArray		03_01_DuplicationInArray
03_02_DuplicationInArrayNoEdit		03_02_DuplicationInArrayNoEdit
04_FindInPartiallySortedMatrix		04_FindInPartiallySortedMatrix
05_ReplaceSpaces		05_ReplaceSpaces
06_PrintListInReversedOrder		06_PrintListInReversedOrder
07_ConstructBinaryTree		07_ConstructBinaryTree
08_NextNodeInBinaryTrees		08_NextNodeInBinaryTrees
09_QueueWithTwoStacks		09_QueueWithTwoStacks
10_Fibonacci		10_Fibonacci
11_MinNumberInRotatedArray		11_MinNumberInRotatedArray
12_StringPathInMatrix		12_StringPathInMatrix
13_RobotMove		13_RobotMove
14_CuttingRope		14_CuttingRope
15_NumberOf1InBinary		15_NumberOf1InBinary
16_Power		16_Power
17_Print1ToMaxOfNDigits		17_Print1ToMaxOfNDigits
18_01_DeleteNodeInList		18_01_DeleteNodeInList
18_02_DeleteDuplicatedNode		18_02_DeleteDuplicatedNode
19_RegularExpressionsMatching		19_RegularExpressionsMatching
21_ReorderArray		21_ReorderArray
22_KthNodeFromEnd		22_KthNodeFromEnd
23_EntryNodeInListLoop		23_EntryNodeInListLoop
24_ReverseList		24_ReverseList
25_MergeSortedLists		25_MergeSortedLists
26_SubstructureInTree		26_SubstructureInTree
27_MirrorOfBinaryTree		27_MirrorOfBinaryTree
28_SymmetricalBinaryTree		28_SymmetricalBinaryTree
29_PrintMatrix		29_PrintMatrix
30_MinInStack		30_MinInStack
31_StackPushPopOrder		31_StackPushPopOrder
32_03_PrintTreesInZigzag		32_03_PrintTreesInZigzag
33_SquenceOfBST		33_SquenceOfBST
41_StreamMedian		41_StreamMedian
43_NumberOf1		43_NumberOf1
52_FirstCommonNodesInLists		52_FirstCommonNodesInLists
54_KthNodeInBST		54_KthNodeInBST
56_01_NumbersAppearOnce		56_01_NumbersAppearOnce
58_02_LeftRotateString		58_02_LeftRotateString
Utilities		Utilities
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md

Repository files navigation

coding-interviews

《剑指Offer》第2版 C++代码

03_01数组中的重复数字

03_02不修改数组找出重复的数字

04二维数组中的查找

05替换空格

06从尾到头打印链表

07重建二叉树

08二叉树的下一个结点

09用两个栈实现队列

10斐波那契数列

11旋转数组的最小数字

12矩阵中的路径

13机器人的运动范围

14剪绳子

15二进制中1的个数

16数值的整数次方

17打印1到最大的n位数

18_01删除链表的结点

18_02删除链表中重复的结点

19正则表达式匹配

21调整数组顺序使奇数位于偶数前面

22链表中倒数第k个结点

23链表中环的入口节点

24反转链表

25合并两个排序的链表

26树的子结构

27二叉树的镜像

28对称的二叉树

29顺时针打印矩阵

30包含min函数的栈

31栈的压入、弹出序列

32_03按之字形顺序打印二叉树

33_二叉搜索树的后序遍历序列

41数据流中的中位数

43从1到n整数中1出现的次数

52两个链表的第一个公共节点

54二叉搜索树的第k大节点

56_01_数组中只出现一次的两个数字

58_02_左旋转字符串

About

《剑指Offer-名企面试官精讲典型编程题》第2版 C++实现

Report repository

Releases

No releases published

Packages

No packages published

Languages