human
What is a the Python code you requested given the following:
Solve in Python:
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.)
assistant
#Here is the Python code you requested.

class Solution:
     def repeatedSubstringPattern(self, s):
         """
         :type s: str
         :rtype: bool
         """
         return any(s[:i] * (len(s) // i) == s for i in range(1, len(s) // 2 + 1) if len(s) % i == 0)