算法設計與分析：Scramble String（Week 8）

學號：16340008 題目：87. Scramble String Question: Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of

>>阅读原文<<