LeetCode笔记：459. Repeated Substring Pattern

最新推荐文章于 2019-12-06 16:04:18 发布

Cloudox_

最新推荐文章于 2019-12-06 16:04:18 发布

阅读量3.3k

点赞数 1

分类专栏： LeetCode LeetCode笔记文章标签： leetcode

本文链接：https://blog.csdn.net/Cloudox_/article/details/53240887

版权

探讨LeetCode问题459，检查非空字符串是否能由其子串重复构造。介绍思路和Java实现，时间复杂度为O(n)，并提供解题代码链接。

摘要由CSDN通过智能技术生成

问题：

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.)