The solution of coding interview(剑指offer) by Java, the scripts is from haoel/leetcode/srcipts
| # | Title | Solution | Difficulty | Method | Times |
|---|---|---|---|---|---|
| 剑指 Offer 03 | 数组中重复的数字 LCOF | Java | Easy | ArraySort HashSet | 1 |
| 剑指 Offer 04 | 二维数组中的查找 LCOF | Java | Easy | Matrix | 1 |
| 剑指 Offer 05 | 替换空格 LCOF | Java | Easy | tow pointers | 1 |
| 剑指 Offer 06 | 从尾到头打印链表 LCOF | Java | Easy | Stack recursive iterate | 1 |
| 剑指 Offer 07 | 重建二叉树 LCOF | Java | Medium | recursive | 1 |
| 剑指 Offer 08 | 二叉树的下一个结点 | Java | Medium | recursive | 1 |
| 剑指 Offer 10- I | 斐波那契数列 LCOF | Java | Easy | Fibonacci | 1 |
| 剑指 Offer 11 | 旋转数组的最小数字 LCOF | Java | Easy | BinarySearch | 1 |
| 剑指 Offer 12 | 矩阵中的路径 LCOF | Java | Medium | DFS BackTracking | 1 |
| 剑指 Offer 13 | 机器人的运动范围 LCOF | Java | Medium | BackTracking DFS BFS | 1 |
| 剑指 Offer 14- I | 剪绳子 LCOF | Java | Medium | DP | 1 |
| 剑指 Offer 15 | 二进制中1的个数 LCOF | Java | Easy | Bit Operation | 1 |
| 剑指 Offer 16 | 数值的整数次方 LCOF | Java | Medium | BinarySearch Bit Operator | 1 |
| 剑指 Offer 17 | 打印从1到最大的n位数 LCOF | Java | Easy | DFS Full Arrangement | 1 |
| 剑指 Offer 18 | 删除链表的节点 LCOF | Java | Easy | ListNode | 1 |