240 发简信
  • 120
    bit manipulation

    Counting Bits [method1] naive O(n*sizeof(int)) side note num/2 ===> num>...

  • 9.26 排序

    167] Two Sum II - Input array is sorted

  • 120
    1.29-。。。 数列

    [ 80 questions / 3 ~= 27 a month..ok.. ] 1.29: remove_duplicatesI-III fo...

  • 9.16 基本树遍历

    --- knowledge ---# of leaves = # of nonleaves + 1 - Binary Tree Inord...

  • 9.5 cc dp-rotate now

    9.1] Climbing Stairs LIC dp O(n^2)lenLIS[i] = max (lenLIS[j] + 1), where...

  • 9.1 cc树与图

    4.1] 实现一个函数,检查二叉树是否平衡。(任二子树高度差不超过一) depth of tree node: # edges from roo...

  • 120
    8.31cc栈和队列

    像是夏日的最后一天 - to do 3.1】用一个数组实现三个栈 3.2】 How would you design a stack which...

  • 8.30 链表

    - to do - linked-list-random-node 水塘抽样是一系列的随机算法,其目的在于从包含n个项目的集合S中选取k个样本,...

  • 8.26 cc链表

    Proposal: - background: Social media has been rapidly gaining its impact...