1.判断QString是否为纯数字
bool IsDigitString(QString strSource)
{
bool bDigit = false;
if (strSource.isEmpty())
{
return bDigit;
}
QByteArray strByteArray = strSource.toLatin1();
const char *chString = strByteArray.data();
while (*chString && *chString>='0' && *chString<='9') chString++;
if (*chString)
{
bDigit = false;
}
else
{
bDigit = true;
}
return bDigit;
}
2.查找自身最长重复子字符串
QString MaxSubString(QString inputString)
{
QString subString = "";
int strLen = inputString.size();
if (strLen <= 0)
{
return subString;
}
int maxSubStrLen = 0;
int tempLen = 0;
int subIndex = 0;
int i = 0;
int j = 0;