(JavaScript)
So, I need a function checkString(str, substr) that checks whether a string is made out of multiple occurences of a given substring.
Examples:
checkString("abc", "abc") -> true
checkString("abcabcabc", "abc") -> true
checkString("abcdef", "abc") -> false
checkString("abcab", "abc) -> true
Could someone help me out?
如果空格不重要，这是一个解决方案:
const checkString = (bigString, subString) => {
const split = bigString.split(subString);
const onlyOccurances = split.filter(v => v === '');
return split.length === onlyOccurances.length
}
checkString("abc", "abc") // true
checkString("abcabcabc", "abc") // true
checkString("abcdef", "abc") // false
bigString.split(subString)将把大字符串分割成一个空字符串数组，如果存在完全匹配的字符串，那么它的长度将正好是发生的次数.如果数组中的任何值不是空字符串，则表示不存在完全匹配，因此按空筛选的值的长度与拆分的值的长度之间存在差异.
希望它有意义.