87.乱串追源
来源:互联网 发布:美工在线培训 编辑:程序博客网 时间:2024/06/09 18:43
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”:
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.
参考答案:
class Solution {public: bool isScramble(string s1, string s2) { if(s1==s2) return true; int len = s1.length(); int count[26] = {0}; for(int i=0; i<len; i++) { count[s1[i]-'a']++; count[s2[i]-'a']--; } for(int i=0; i<26; i++) { if(count[i]!=0) return false; } for(int i=1; i<=len-1; i++) { if( isScramble(s1.substr(0,i), s2.substr(0,i)) && isScramble(s1.substr(i), s2.substr(i))) return true; if( isScramble(s1.substr(0,i), s2.substr(len-i)) && isScramble(s1.substr(i), s2.substr(0,len-i))) return true; } return false; }};
性能:
- 87.乱串追源
- 87. 日期
- 87. xml
- LeetCode 87. Scramble String
- 87. 再谈变体型Variant
- [Leetcode] 87. Scramble String
- LeetCode --- 87. Scramble String
- 87.计算n!
- 87. Scramble String
- [leetcode] 87.Scramble String
- 87.Summary Ranges
- 87. Scramble String
- LeedCode 87. Scramble String
- 87. Scramble String
- 新BOJ 87. 日期
- Leetcode 87. Scramble String
- Leetcode 87. Scramble String
- 87. Repeated DNA Sequences
- 史上最全量化交易资源整理
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0
- mac OSX10.12 sierra 安装python-ldap报missing sasl.h错误
- 单例模式之懒汉的并发问题
- Java 数据结构
- 87.乱串追源
- Codeforces 863DYet Another Array Queries Problem
- 为什么V8引擎这么快?
- bzoj 2212(线段树合并)
- 干货 | 深度学习之DNN的多种正则化方式
- gradle镜像文件地址
- java闪屏类
- 面向对象的“形”与“本”
- vue2.0实现引用qrcode.js实现获取改变二维码的样式(2)