# Records of Practice

记录一下之后的练习，虽然之前的没有记录下来

6/12/2021

1.  &#x20;Tree

    a.  Mirror of tree: [https://www.nowcoder.com/practice/a9d0ecbacef9410ca97463e4a5c83be7?tpId=13&\&tqId=11171\&rp=1\&ru=/ta/coding-interviews\&qru=/ta/coding-interviews/question-ranking](https://www.nowcoder.com/practice/a9d0ecbacef9410ca97463e4a5c83be7?tpId=13&\&tqId=11171\&rp=1\&ru=/ta/coding-interviews\&qru=/ta/coding-interviews/question-ranking)

    b. in-order traversal of tree (iteration):   [https://app.laicode.io/app/problem/43](https://app.laicode.io/app/problem/43)

    c. 二叉搜索树的后序遍历序列: [https://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&\&tqId=11176\&rp=1\&ru=/ta/coding-interviews\&qru=/ta/coding-interviews/question-ranking](https://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&\&tqId=11176\&rp=1\&ru=/ta/coding-interviews\&qru=/ta/coding-interviews/question-ranking)

6/15/2021

1. DP
   1. 子数组的最大累加和问题： [https://www.nowcoder.com/practice/554aa508dd5d4fefbf0f86e5fe953abd?tpId=188&\&tqId=38594\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/554aa508dd5d4fefbf0f86e5fe953abd?tpId=188&\&tqId=38594\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking)
   2. 子数组最大乘积[https://www.nowcoder.com/practice/9c158345c867466293fc413cff570356?tpId=188&\&tqId=38656\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/9c158345c867466293fc413cff570356?tpId=188&\&tqId=38656\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking)
   3. 三个数的最大乘积[https://www.nowcoder.com/practice/8ae05c2913fe438b8b14f3968f64fc0b?tpId=188&\&tqId=38616\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/8ae05c2913fe438b8b14f3968f64fc0b?tpId=188&\&tqId=38616\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking)
2. LinkedList
   1. 删除链表的倒数第n个节点[https://www.nowcoder.com/practice/f95dcdafbde44b22a6d741baf71653f6?tpId=188&\&tqId=38587\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/f95dcdafbde44b22a6d741baf71653f6?tpId=188&\&tqId=38587\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking)

6/17/2021

1. Tree
   1. 重建二叉树[https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=191&\&tqId=35922\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-algorithm/question-ranking](https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=191&\&tqId=35922\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-algorithm/question-ranking)
   2. 判断二叉树是否对称[https://www.nowcoder.com/practice/1b0b7f371eae4204bc4a7570c84c2de1?tpId=188&\&tqId=38623\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/1b0b7f371eae4204bc4a7570c84c2de1?tpId=188&\&tqId=38623\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking)
   3. 二叉树是否存在和为目标值的路径[https://www.nowcoder.com/practice/508378c0823c423baa723ce448cbfd0c?tpId=188&\&tqId=38614\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/508378c0823c423baa723ce448cbfd0c?tpId=188&\&tqId=38614\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking)

6/22/2021

1. Divide and Conquer
   1. 找第K大的元素[https://www.nowcoder.com/practice/e016ad9b7f0b45048c58a9f27ba618bf?tpId=188&\&tqId=38572\&rp=1\&ru=/ta/job-code-high-week\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/e016ad9b7f0b45048c58a9f27ba618bf?tpId=188&\&tqId=38572\&rp=1\&ru=/ta/job-code-high-week\&qru=/ta/job-code-high-week/question-ranking)

6/27/2021

1. Array
   1. 最长无重复子数组:[https://www.nowcoder.com/practice/b56799ebfd684fb394bd315e89324fb4?tpId=188&\&tqId=38553\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/b56799ebfd684fb394bd315e89324fb4?tpId=188&\&tqId=38553\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking)
   2. 链表的奇偶重排[https://www.nowcoder.com/practice/02bf49ea45cd486daa031614f9bd6fc3?tpId=188&\&tqId=38658\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/02bf49ea45cd486daa031614f9bd6fc3?tpId=188&\&tqId=38658\&rp=1\&ru=/activity/oj\&qru=/ta/job-code-high-week/question-ranking)
   3. 数组中的最长连续子序列[https://www.nowcoder.com/practice/eac1c953170243338f941959146ac4bf?tpId=188&\&tqId=38566\&rp=1\&ru=/ta/job-code-high-week\&qru=/ta/job-code-high-week/question-ranking](https://www.nowcoder.com/practice/eac1c953170243338f941959146ac4bf?tpId=188&\&tqId=38566\&rp=1\&ru=/ta/job-code-high-week\&qru=/ta/job-code-high-week/question-ranking)



