Problem: 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 e
赋值运算 赋值运算的形式为左值 = 右值.如果同个表达式中有多个赋值运算,则从右到左运算.例如: a = b = c; // 和下面两行等价 b = c; a = b; 另外一种赋值运算的形式叫做复合赋值运算符,形式为左值 op= 右值,其中op=表示部分运算符和=的结合,a op= b和 a = a op b等价.例如下面两句是等价的: a += b; a = a + b; 其中op可以是下列运算符之一: +,-,*,/,%,<<,>>,>>>,&,|,