240 发简信
IP属地:加州
  • LintCode: Minimum Size Subarray Sum

    Given an array of n positive integers and a positive integer s, find the...

  • LintCode: Flatten Binary Tree to Linked List

    Flatten a binary tree to a fake "linked list" in pre-order traversal.Her...

  • LintCode: Binary Search Tree Iterator

    与二叉树的中序遍历(非递归)相似, 以一个数组来存储stand-by的节点, 以root和stack来判定是否hasNext(), 当hasNe...