摘要： You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in sthat is a concat 阅读全文

摘要： You need to find the largest value in each row of a binary tree. Example: 基础中的基础，树的层次遍历/广度优先搜索。在搜索中存储每一行的最大值只不过是多加了两行代码。不应该是中等难度的题。 Java 阅读全文

摘要： A gene string can be represented by an 8-character long string, with choices from "A", "C", "G", "T". Suppose we need to investigate about a mutation 阅读全文