Leetcode 87 Scramble String
2016-06-04 23:01
369 查看
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 =
To scramble the string, we may choose any non-leaf node and swap its two children.
For example, if we choose the node
We say that
Similarly, if we continue to swap the children of nodes
We say that
Given two strings s1 and s2 of the same length, determine if s2 is a scrambled string of s1.
失误点:做题的时候,一定要先把逻辑想清楚了再去做
2、一定要注意越界问题,最好用几个测试样例去一步一步跑
答案地址: http://www.cnblogs.com/easonliu/p/3696135.html
Below is one possible representation of s1 =
"great":
great / \ gr eat / \ / \ g r e at / \ a t
To scramble the string, we may choose any non-leaf node and swap its two children.
For example, if we choose the node
"gr"and swap its two children, it produces a scrambled string
"rgeat".
rgeat / \ rg eat / \ / \ r g e at / \ a t
We say that
"rgeat"is a scrambled string of
"great".
Similarly, if we continue to swap the children of nodes
"eat"and
"at", it produces a scrambled string
"rgtae".
rgtae / \ rg tae / \ / \ r g ta e / \ t a
We say that
"rgtae"is a scrambled string of
"great".
Given two strings s1 and s2 of the same length, determine if s2 is a scrambled string of s1.
失误点:做题的时候,一定要先把逻辑想清楚了再去做
2、一定要注意越界问题,最好用几个测试样例去一步一步跑
答案地址: http://www.cnblogs.com/easonliu/p/3696135.html
相关文章推荐
- 68. Text Justification
- 经典算法之快速排序算法
- 虚拟机类加载机制
- windows平台上搭建node.js开发环境
- PHPStorm中$_POST和$_FILES取不到值问题
- java 实现以字符为单位读取文件(3)
- 一个工作一年半的程序员的自述(四)
- 虚拟机类加载机制
- java之内存管理
- php apache mysql 64位
- 初识dll,在VS2010平台上创建并使用dll(revised)
- java 实现以字节为单位读取文件(2)
- ListView中视频播放的解决方案
- Guava base -- CaseFormat
- java 实现以行为单位读取txt文件(1)
- reactjs入门到实战(四)---- state详解
- 67. Add Binary
- kali配置openvas
- 高德地图签名提示“INVALID_USER_SCODE”处理
- spring mvc返回类型