haoweizh

摘要： Problem: Given an array A, partition it into two (contiguous) subarrays left and right so that: Every element in left is less than or equal to every e 阅读全文

摘要： 序： 用于记录刷题过程中难度较大或思路怪异的题目，对于常规难度一般的题就不写入我的博客了，关于效率仅是提交时击败的百分比，可能会随时间波动，仅供参考，算法优劣以时间复杂度和空间复杂度为基准。欢迎留言讨论。 阅读全文

摘要： Problem: In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants 阅读全文