《剑指offer》牛客网刷题总结点击题目可以跳转到牛客网上对应的AC提交记录，点击python可以跳转到库中存储的多种求解代码。TitleSolutionTimeSpaceCategory二维数组中的查找PythonO(n)O(1)数组替换空格PythonO(n)O(1)字符串从尾到头打印链表PythonO(n)O(1)链表斐波那契数列PythonO(n)O(1)循环》递归跳台阶PythonO(n)O(1)循环》递归用两个栈实现队列Python__栈、队列变态跳台阶PythonO(1)O(1)循环旋转数组的最小数字PythonO(logn)O(1)查找二进制中1的个数PythonO(n)O(1)位运算重建二叉树PythonO(logn)O(1)二叉树链表中倒数第k个结点PythonO(n)O(1)链表，代码完整性矩形覆盖PythonO(n)O(1)动规反转链表PythonO(n)O(1)链表、代码完整性调整数组顺序使奇数位于偶数前面PythonO(nlogn)O(1)数组数值的整数次方PythonO(logn)O(1)代码完整性合并两个排序的链表 \\ 进阶题目：合并k个有序链表PythonO(n+m)O(1)代码鲁棒性二叉树的镜像PythonO(logn)O(1)二叉树树的子结构PythonO(m)~O(n*m)O(1)代码鲁棒性从上往下打印二叉树PythonO(n)O(n)二叉树栈的压入、弹出序列PythonO(n)O(1)~O(n)栈包含min函数的栈PythonO(1)O(n)栈顺时针打印矩阵PythonO(n*m)O(1)数组数组中出现次数超过一半的数字PythonO(2n)O(1)数组二叉搜索树的后序遍历序列PythonO(nlogn)O(1)二叉树最小的K个数PythonO(n)O(1)数组连续子数组的最大和PythonO(n)O(1)动规二叉树中和为某一值的路径PythonO(logn)O(1)二叉树二叉树的深度PythonO(logn)O(1)二叉树第一个只出现一次的字符位置PythonO(n)O(1)字符串求1+2+3+...+nPythonO(n)O(1)构造函数字符串的排列PythonO(n^2)O(1)递归两个链表的第一个公共结点PythonO(n+m)O(1)链表数字在排序数组中出现的次数PythonO(logn)O(1)二分复杂链表的复制PythonO(n)O(1)链表数组中只出现一次的数字PythonO(n)O(1)位运算丑数PythonO(n)O(n)数学数组中重复的数字PythonO(n)O(1)数组把数组排成最小的数PythonO(nlogn)O(1)数组和为S的两个数字PythonO(n)O(1)双指针整数中1出现的次数（从1到n整数中1出现的次数）PythonO(logn)O(1)数学规律左旋转字符串PythonO(n)O(1)字符串平衡二叉树PythonO(logn)O(1)二叉树翻转单词顺序列PythonO(n)O(1)字符串二叉搜索树与双向链表PythonO(n)O(1)二叉树、双向链表和为S的连续正数序列PythonO(n)O(1)双指针不用加减乘除做加法PythonO(1)O(1)位运算删除链表中重复的结点PythonO(n)O(1)链表链表中环的入口结点PythonO(n)O(1)链表数组中的逆序对PythonO(nlogn)O(n)归并把字符串转换成整数PythonO(n)O(1)字符串对称的二叉树PythonO(logn)O(1)二叉树扑克牌顺子PythonO(1)O(1)数学规律孩子们的游戏(圆圈中最后剩下的数)PythonO(n)O(1)动规、环形链表二叉树的下一个结点PythonO(n)O(1)二叉树构建乘积数组PythonO(n)O(n)数组把二叉树打印成多行PythonO(n)O(n)二叉树二叉搜索树的第k个结点PythonO(nlogn)O(n)树按之字形顺序打印二叉树PythonO(n)O(n)二叉树字符流中第一个不重复的字符PythonO(n)O(1)字符串滑动窗口的最大值PythonO(n)O(1)双向队列表示数值的字符串PythonO(1)O(1)正则表达式机器人的运动范围PythonO(n^2)O(n^2)回溯法正则表达式匹配PythonO(n)O(1)正则表达式矩阵中的路径PythonO(n^2)O(1)回溯法序列化二叉树PythonO(logn)O(1)二叉树数据流中的中位数Python插入O(logn) \ 中位数O(1)O(1)树、堆