Sequence | Problem | Level | Language | Notes | Build |
---|---|---|---|---|---|
001 | A + B 问题 | Easy | C++ | 异或 | Passing |
002 | 尾部的零 | Easy | C++ | 递归 | Passing |
003 | 统计数字 | Medium | C++ | Passing | |
004 | 丑数 II | Medium | C++ | Passing | |
005 | 第k大元素 | Medium | C++ | Passing | |
006 | 合并排序数组 | Easy | C++ | Passing | |
009 | Fizz Buzz 问题 | Easy | C++ | Passing | |
012 | 带最小值操作的栈 | Medium | C++ | Passing | |
014 | 二分查找 | Easy | C++ | Passing | |
028 | 搜索二维矩阵 | Easy | C++ | 二分 | Passing |
031 | 数组划分 | Medium | C++ | Passing | |
035 | 翻转链表 | Easy | C++ | Passing | |
036 | 翻转链表 II | Medium | C++ | Passing | |
038 | 搜索二维矩阵 II | Medium | C++ | 二分 | Passing |
039 | 恢复旋转排序数组 | Easy | C++ | Passing | |
040 | 用栈实现队列 | Medium | C++ | Passing | |
041 | 最大子数组 | Easy | C++ | Passing | |
042 | 最大子数组 II | Medium | C++ | Passing | |
043 | 最大子数组 III | Hard | C++ | Passing | |
044 | 最小子数组 | Easy | C++ | Passing | |
045 | 最大子数组差 | Medium | C++ | Passing | |
046 | 主元素 | Easy | C++ | Passing | |
047 | 主元素 II | Medium | C++ | Hash | Passing |
048 | 主元素 III | Medium | C++ | Hash | Passing |
049 | 字符大小写排序 | Medium | C++ | Passing | |
056 | 两数之和 | Easy | C++ | Passing | |
057 | 三数之和 | Medium | C++ | Passing | |
062 | 搜索旋转排序数组 | Medium | C++ | 二分 | Passing |
063 | 搜索旋转排序数组 II | Medium | C++ | 二分 | Passing |
066 | 二叉树的前序遍历 | Easy | C++ | 递归 | Passing |
067 | 二叉树的中序遍历 | Easy | C++ | 递归 | Passing |
068 | 二叉树的后序遍历 | Easy | C++ | 递归 | Passing |
069 | 二叉树的层次遍历 | Easy | C++ | BFS | Passing |
070 | 二叉树的层次遍历 II | Medium | C++ | BFS | Passing |
075 | 寻找峰值 | Medium | C++ | Passing | |
076 | 最长上升子序列 | Medium | C++ | LIS+序列型DP | Passing |
077 | 最长公共子序列 | Medium | C++ | LCS+序列型DP | Passing |
080 | 中位数 | Easy | C++ | Passing | |
082 | 落单的数 | Easy | C++ | Passing | |
083 | 落单的数 II | Medium | C++ | Passing | |
084 | 落单的数 III | Medium | C++ | Passing | |
085 | 在二叉查找树中插入节点 | Easy | C++ | 递归 | Passing |
088 | 最近公共祖先 | Medium | C++ | Passing | |
096 | 链表划分 | Easy | C++ | 两根指针 | Passing |
097 | 二叉树的最大深度 | Easy | C++ | 递归 | Passing |
099 | 重排链表 | Medium | C++ | Passing | |
100 | 删除排序数组中的重复数字 | Easy | C++ | Passing | |
101 | 删除排序数组中的重复数字 II | Easy | C++ | Passing | |
102 | 带环链表 | Medium | C++ | 快慢指针 | Passing |
103 | 带环链表 II | Hard | C++ | 快慢指针 | Passing |
104 | 合并k个排序链表 | Medium | C++ | Passing | |
105 | 复制带随机指针的链表 | Medium | C++ | Hash | Passing |
106 | 排序列表转换为二分查找树 | Medium | C++ | Passing | |
112 | 删除排序链表中的重复元素 | Easy | C++ | Passing | |
113 | 删除排序链表中的重复数字 II | Medium | C++ | Passing | |
114 | 不同的路径 | Easy | C++ | Passing | |
115 | 不同的路径 II | Easy | C++ | 棋盘型DP | Passing |
116 | 跳跃游戏 | Medium | C++ | 贪心 | Passing |
117 | 跳跃游戏 II | Medium | C++ | 贪心 | Passing |
118 | 不同的子序列 | Medium | C++ | DP | Passing |
149 | 买卖股票的最佳时机 | Medium | C++ | Passing | |
150 | 买卖股票的最佳时机 II | Medium | C++ | Passing | |
151 | 买卖股票的最佳时机 III | Medium | C++ | 前后遍历 | Passing |
157 | 判断字符串是否没有重复字符 | Easy | C++ | Passing | |
161 | 旋转图像 | Medium | C++ | Passing | |
162 | 矩阵归零 | Medium | C++ | Passing | |
165 | 合并两个排序链表 | Easy | C++ | Passing | |
166 | 链表倒数第n个节点 | Easy | C++ | Passing | |
167 | 链表求和 | Easy | C++ | Passing | |
170 | 旋转链表 | Medium | C++ | Passing | |
173 | 链表插入排序 | Easy | C++ | Passing | |
174 | 删除链表中倒数第n个节点 | Easy | C++ | Passing | |
175 | 翻转二叉树 | Easy | C++ | 递归 | Passing |
201 | 线段树的构造 | Medium | C++ | 线段树 | Passing |
221 | 链表求和 II | Medium | C++ | Passing | |
223 | 回文链表 | Medium | C++ | Passing | |
372 | 在O(1)时间复杂度删除链表节点 | Easy | C++ | Passing | |
373 | 奇偶分割数组 | Easy | C++ | 首尾指针 | Passing |
366 | 斐波纳契数列 | Naive | C++ | Passing | |
375 | 克隆二叉树 | Easy | C++ | 递归 | Passing |
378 | 将二叉查找树转换成双链表 | Medium | C++ | Passing | |
380 | 两个链表的交叉 | Medium | C++ | Passing | |
383 | 装最多水的容器 | Medium | C++ | 首尾指针 | Passing |
394 | 硬币排成线 | Medium | C++ | Passing | |
418 | 整数转罗马数字 | Medium | C++ | Passing | |
419 | 罗马数字转整数 | Medium | C++ | Passing | |
439 | 线段树的构造 II | Medium | C++ | 线段树 | Passing |
450 | K组翻转链表 | Hard | C++ | Passing | |
451 | 两两交换链表中的节点 | Easy | C++ | Passing | |
452 | 删除链表中的元素 | Naive | C++ | Passing | |
463 | 整数排序 | Naive | C++ | Passing | |
469 | 等价二叉树 | Easy | C++ | 递归 | Passing |
508 | 摆动排序 | Medium | C++ | Passing | |
511 | 交换链表当中两个节点 | Medium | C++ | Passing | |
517 | 丑数 | Easy | C++ | Passing | |
518 | 超级丑数 | Medium | C++ | Passing | |
528 | 摊平嵌套的列表 | Medium | C++ | Passing | |
608 | Two Sum - Input array is sorted | Medium | C++ | Passing | |
632 | 二叉树的最大节点 | Naive | C++ | Passing | |
690 | Factorial | Hard | C++ | Passing | |
697 | Check Sum of Square Numbers | Easy | C++/Java/Python | Passing |
shiqitao / lintcode-solutions Goto Github PK
View Code? Open in Web Editor NEWSolutions for LintCode Algorithm Problems