随笔分类 - Hash(哈希)
摘要:Isomorphic Inversion 题目描述 Let s be a given string of up to 106 digits. Find the maximal k for which it is possible to partition s into k consecutive c
阅读全文
摘要:Similarity of Subtrees 题目描述 Define the depth of a node in a rooted tree by applying the following rules recursively:·The depth of a root node is 0.·Th
阅读全文

浙公网安备 33010602011771号