Veritas des Liberty

摘要： Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文

摘要： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文

摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. N 阅读全文

摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文

摘要： "Top-down" Solution Here is the pseudocode for the recursion function maximum_depth(root, depth): 1. return if root is null 2. if root is a leaf node: 阅读全文

摘要： You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k lists. We define 阅读全文

摘要： Given a list of directory info including directory path, and all the files with contents in this directory, you need to find out all the groups of dup 阅读全文

摘要： Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list of favorite restaurants represented by strings. You need to h 阅读全文

摘要： We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly1. Now, given an integer array 阅读全文

摘要： Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of th 阅读全文