摘要：
Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. Example 1: # it actually examines the know 阅读全文
摘要：
Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST. Assume a BST is define 阅读全文
摘要：
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be rep 阅读全文
摘要：
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. Example 1:Input: "bbbab 阅读全文
摘要：
In LeetCode Store, there are some kinds of items to sell. Each item has a price. However, there are some special offers, and a special offer consists 阅读全文
摘要：
In the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to reach o 阅读全文
摘要：
<<Fast top-k search in knowledge graphs>> Publication: ICDE 2016 Authors: Shengqi Yang∗, Fangqiu Han∗, Yinghui Wu†, Xifeng Yan∗ Affiliation: UCSB, WSU 阅读全文
摘要：
For currently popular distributed framework Spark, here it shows the intro and steps to configure the spark standalone mode on several machines. It is 阅读全文
摘要：
Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like this: "...zabcdefghijklmnopqrstuvwxyza 阅读全文
摘要：
Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should 阅读全文