2013年7月21日
摘要: 题目:Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation ofs1="great": great / \ gr eat / \ / \g r e at / \ a tTo scramble the string, we may choose any non-leaf... 阅读全文
posted @ 2013-07-21 17:18 lichen782 阅读(1963) 评论(1) 推荐(0) 编辑