Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase English letters only and its length will not exceed 10000.
Example 1:
Input: "abab"Output: TrueExplanation: It's the substring "ab" twice.Example 2:
Input: "aba"Output: FalseExample 3:
Input: "abcabcabcabc"Output: TrueExplanation: It's the substring "abc" four times. (And the substring "abcabc" twice.)class Solution {public: bool repeatedSubstringPattern(string str) { int len = str.length(), i, j; for(i = 1; i <= len / 2; i++){ if(len % i == 0){ string mode = str.substr(0, i); for(j = i; j < len; j += i){ string tmp = str.substr(j, i); if(tmp != mode) break; } if(j == len) return true; } } return false; }};新聞熱點
疑難解答
