[leetcode] 87. Scramble String

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.node Below is one possible representation of s1 = "great":算法 great / \ gr
相关文章
相关标签/搜索