LeetCode: Scramble String, a naive recursion solution
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 s1 = "great":
great
/ \
gr
原创
2013-05-20 14:07:02 ·
1127 阅读 ·
0 评论