yanring/剑指offer - leetcode 对应.md

## 剑指offer - leetcode 对应.md

      
    Raw
  

              剑指offer - leetcode 对应.md
            
          
    update 完整版迁移至：https://github.com/yanring/jianzhi-Offer-Leetcode


重建二叉树 -> https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/


√矩阵中的路径 -> https://leetcode.com/problems/word-search/
机器人的运动范围 -> 没找到
剪绳子（dp） -> 没找到
√二进制中1的个数 -> https://leetcode.com/problems/number-of-1-bits/ ->（升级版）https://leetcode.com/problems/counting-bits/
√数值的整数次方（溢出） -> https://leetcode.com/problems/powx-n/
打印从1到最大的n位数（溢出） -> 没找到
√删除链表的节点 ->（简单版）https://leetcode.com/problems/delete-node-in-a-linked-list/ ->（升级版）https://leetcode.com/problems/remove-linked-list-elements
×正则表达式匹配 -> https://leetcode.com/problems/regular-expression-matching/
×表示数值的字符串 -> https://leetcode.com/problems/valid-number/
√调整数组顺序使奇数在偶数前 -> https://leetcode.com/problems/sort-array-by-parity
√链表中倒数第K个节点 -> https://leetcode.com/problems/remove-nth-node-from-end-of-list/
√链表中环的入口节点 -> https://leetcode.com/problems/linked-list-cycle-ii
√反转链表 -> 只用了递归，下次用循环 https://leetcode.com/problems/reverse-linked-list/
√合并两个排序的链表 -> https://leetcode.com/problems/merge-two-sorted-lists/
√树的子结构 -> * https://leetcode.com/problems/subtree-of-another-tree/
√二叉树的镜像 -> https://leetcode.com/problems/invert-binary-tree
√对称的二叉树 -> https://leetcode.com/problems/symmetric-tree/
√顺时针打印矩阵 -> https://leetcode.com/problems/spiral-matrix/
√包含min函数的栈 -> https://leetcode.com/problems/min-stack/
√栈的压入、弹出序列 ->* https://leetcode.com/problems/validate-stack-sequences/
√从上到下打印二叉树 -> https://leetcode.com/problems/binary-tree-level-order-traversal/ -> 从下到上 https://leetcode.com/problems/binary-tree-level-order-traversal-ii/ -> 之字形打印 https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/
二叉搜索树的后序遍历序列 -> *（只有先序遍历）https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/
√二叉树中和为某一值得路径 -> https://leetcode.com/problems/path-sum/
√复杂链表的复制 -> https://leetcode.com/problems/copy-list-with-random-pointer/
√二叉搜索树与双向链表 -> *（收费）https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/ -> （牛客网）https://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5?tpId=13&tqId=11179&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
√序列化二叉树 -> https://leetcode.com/problems/serialize-and-deserialize-binary-tree/
√字符串的排列 -> （原理相同，leetcode用的数组）https://leetcode.com/problems/permutations/ ->(有重复元素的情况) https://leetcode.com/problems/permutations-ii
√数组中出现次数超过一半的数字 -> https://leetcode.com/problems/majority-element/ -> （升级版） https://leetcode.com/problems/majority-element-ii/
√最小的k个数 -> *（类似）https://leetcode.com/problems/kth-largest-element-in-an-array/
√数据流中的中位数 -> * https://leetcode.com/problems/find-median-from-data-stream/
√连续子数组的最大和 -> https://leetcode.com/problems/maximum-subarray/
√1~n整数中1出现的次数 -> https://leetcode.com/problems/number-of-digit-one/submissions/
√数字序列中某一位的数字 -> https://leetcode.com/problems/nth-digit/
√把数组排成最小的数 -> https://leetcode.com/problems/largest-number/
√把数字翻译成字符串 -> (递归or动归) https://leetcode.com/problems/decode-ways/
礼物最大值 -> 未找到
√最长不含重复字符的子字符串 -> https://leetcode.com/problems/longest-substring-without-repeating-characters/
√丑数 -> （有更好的解法）https://leetcode.com/problems/ugly-number-ii/
√第一个只出现一次的字符 ->  https://leetcode.com/problems/first-unique-character-in-a-string/
数组中的逆序对 -> （升级版）https://leetcode.com/problems/reverse-pairs/#/description
√两个链表的第一个公共节点 -> https://leetcode.com/problems/intersection-of-two-linked-lists/
√在排序数组中查找数字 -> https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/submissions/
二叉搜索树的第K大节点 -> https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/
二叉树的深度 -> https://leetcode.com/problems/maximum-depth-of-binary-tree/
数组中数字出现的次数 -> https://leetcode.com/problems/single-number-iii/
和为S的数字 —> https://leetcode.com/problems/two-sum/
翻转字符串 -> https://leetcode.com/problems/reverse-words-in-a-string/
队列的最大值 ->