459. Repeated Substring Pattern

标签：pattern   pat   lower   empty   ons   const   sub   exp   nat   

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: True Explanation: It‘s the substring "ab" twice.

Example 2:

Input: "aba" Output: False

Example 3:

Input: "abcabcabcabc" Output: True Explanation: It‘s the substring "abc" four times. (And the substring "abcabc" twice.)

459. Repeated Substring Pattern

标签：pattern   pat   lower   empty   ons   const   sub   exp   nat   

原文地址：https://www.cnblogs.com/MarkLeeBYR/p/10678556.html