字符串中最长的连续数字字串

在字符串中找出连续最长的数字串, 例如：abcd12345ed125ss123456789, 输出123456789。

思路：利用一个数组记录各个数字字串的长度。

代码如下：

void LongestSubNumberString(const char *Str)
{
    assert (Str != NULL);

    int nLength = strlen (Str);

    if (0 == nLength)
    {
        printf ("空字符串!\n");
        return;
    }

    int *MaxLen = NULL;

    if (NULL == (MaxLen = (int *)malloc (nLength * sizeof (int))))
    {
        printf ("Fail to malloc space to MaxLen.\n");
        return;
    }

    const char *pCh = Str;
    int i = 0;

    if ((*pCh >= '0') && (*pCh <= '9'))
    {
        MaxLen[i] = 1;
        ++pCh;
        ++i;
    }
    else
    {
        MaxLen[i] = 0;
        ++pCh;
        ++i;
    }

    while (*pCh != '\0')
    {
        if ((*pCh >= '0') && (*pCh <= '9'))
        {
            MaxLen[i] = MaxLen[i-1] + 1;
            ++pCh;
            ++i;
        }
        else
        {
            MaxLen[i] = 0;
            ++pCh;
            ++i;
        }
    }

    int nMax = 0;
    int j;

    for (i = 0; i < nLength; ++i)
    {
        if (MaxLen[i] > nMax)
        {
            nMax = MaxLen[i];
            j = i;
        }
    }

    if (0 == nMax)
    {
        printf ("这个字符串不包含数字字串.\n");
        return;
    }

    printf ("最长的数字字串是:\n");
    pCh = Str + j - nMax + 1;

    while (nMax > 0)
    {
        printf ("%c", *pCh);
        ++pCh;
        --nMax;
    }

    printf ("\n");
}

一些测试结果：