[459. Repeated Substring Pattern](https://leetcode.cn/problems/repeated-substring-pattern/)

 

| English | 简体中文 |

459. Repeated Substring Pattern

Description

Given a string s, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.

 

Example 1:

Input: s = "abab"
Output: true
Explanation: It is the substring "ab" twice.

Example 2:

Input: s = "aba"
Output: false

Example 3:

Input: s = "abcabcabcabc"
Output: true
Explanation: It is the substring "abc" four times or the substring "abcabc" twice.

 

Constraints:

  • 1 <= s.length <= 104
  • s consists of lowercase English letters.

Similar Questions

Licensed under CC BY-NC-SA 4.0
最后更新于 2024-10-18