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.
Below is one possible representation of s1 = "great"
:
Read full article from LeetCode 87. Scramble String - 郭玉晨的博客
No comments:
Post a Comment