• 求一个字串中最长的连续字符串


    举样例来说:对于字符串"1234abcdef1234567abcdefghijklmn",这个字串中最长的连续字符串为“abcdefghijklmn”。




    int continumax(char *outputstr,char *inputstr)
    {
    	char maxrecord[100] = {0};
    	int maxlength = 0;
    
    	char currentrecord[100] = {0};
    	int currentlength = 0;
    
    	char value = 0;
    	char *p = inputstr;
    	
    	while(*p++ != '')
    	{
    		if (value + 1 == *p)
    		{
    			value = *p;
    			currentrecord[currentlength] = *p;
    			currentlength++;
    		}
    		else
    		{
    			if (currentlength > maxlength)
    			{
    				maxlength = currentlength;
    				memcpy(maxrecord, currentrecord, currentlength);
    			}
    
    			currentlength = 0;
    			memset(currentrecord, 0, 100);
    			
    			value = *p;
    			currentrecord[currentlength] = *p;
    			currentlength++;
    
    		}
    	}
    
    	if (currentlength > maxlength)
    	{
    		maxlength = currentlength;
    		memcpy(maxrecord, currentrecord, currentlength);
    	}
    
    	memcpy(outputstr, maxrecord, maxlength);
    	return maxlength;
    }
    





  • 相关阅读:
    屯【水】题计划
    【BZOJ2157】旅游
    【BZOJ2143】飞飞侠
    【BZOJ1036】[ZJOI2008]树的统计Count
    flask基础
    数据分析之Matplotlib
    pycharm 快捷键
    数据分析之pandas02
    数据分析之pandas01
    隐匿函数,二分法 冒泡排序
  • 原文地址:https://www.cnblogs.com/yutingliuyl/p/7214364.html
Copyright © 2020-2023  润新知