微软100题（87）最大连续递增数字串

1.求最大连续递增数字串（如“ads3sl456789DF3456ld345AA”中的“456789”）

思路：要求是数字串，还得是连续的数字 123  345这类，245则是两个串2 和45

#include "stdafx.h"
#include <iostream>
#include <string>

using namespace std;

//求最大连续递增数字串
string FindMaxIncreNumberSeq(string str)
{
    if ("" == str || str.length() <= 0)
    {
        return NULL;
    }
    int maxlength = 0;
    int start = -1;
    int count = 0;
    int pos = -1;
    bool isbegin = true;
    for (int i = 0; i < str.length(); i++)
    {
        if (str[i] >= '0' && str[i] <= '9')
        {
            if (isbegin)
            {
                pos = i;
                isbegin = false;
                count = 1;
            }
            else if (str[i] - str[i - 1] == 1)
            {
                count++;
            }
            else
            {
                if (maxlength < count)
                {
                    maxlength = count;
                    start = pos;
                }
                pos = i;
                count = 1;
            }

            if (maxlength < count)
            {
                maxlength = count;
                start = pos;
            }
        }
        else
        {
            if (maxlength < count)
            {
                maxlength = count;
                start = pos;
            }
            isbegin = true;
        }
    }
    return str.substr(start, maxlength);
}