Voyz's Studio.

LeetCode算法笔记--字符串轮转

字数统计: 190阅读时长: 1 min
2020/09/09 Share

LeetCode算法笔记–Day6

01.09. 字符串轮转

题目:

字符串轮转。给定两个字符串s1和s2,请编写代码检查s2是否为s1旋转而成(比如,waterbottle是erbottlewat旋转后的字符串)。

示例1:
输入: s1 = “waterbottle”, s2 = “erbottlewat”
输出: True

示例2:
输入: s1 = “aa”, “aba”
输出: False

我的解答:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
/**
* @param {string} s1
* @param {string} s2
* @return {boolean}
*/
var isFlipedString = function(s1, s2) {
let _s1 = s1.split("").sort();
let _s2 = s2.split("").sort();
let isFliped = false;

if(_s1.length == _s2.length && _s1.length != 0){
if(_s1.toString() == _s2.toString()){
for(let i=0;i<_s1.length;i++){
if(s1.substr(i) + s1.substr(0,i) == s2){
isFliped = true;
}
}
}else{
return false;
}
}else if(_s1.length == _s2.length && _s2.length == 0){
return true;
}else{
return false;
}
return isFliped;
};
CATALOG
  1. 1. LeetCode算法笔记–Day6
  2. 2. 01.09. 字符串轮转
    1. 2.0.0.0.1. 题目:
    2. 2.0.0.0.2. 我的解答: