国产精品国色综合久久,香蕉99久久国产综合精品宅男自,国产精品久久久久久

C++ Jounior

once setback,once inspiration,once self-awareness
重要的是這個(gè)磨練過(guò)程，而不是結(jié)果，要的是你粗壯的腿，而不是你身上背的那袋鹽巴

求得含有最多連續(xù)特定字符個(gè)數(shù)的字符串

int ?GetMaxCountofContinuousLetter( char ? * ?p, char ?searchChar)

{

???? int ?maxCount? = 0 ;

???? int ?currentCount? = ? 0 ;

???? while ( 1 )

???? {

???????? if ( * p? == ?searchChar)

???????? {

????????????currentCount? = ? 0 ;

???????????? while ( * p? && ? * p? == ?searchChar)

???????????? {

????????????????currentCount? ++ ;

????????????????p ++ ;

????????????}

???????????? if (maxCount? < ?currentCount)

????????????????maxCount? = ?currentCount;

????????}

???????? if ( * p? == ? ' \0 ' )?

???????????? break ;

???????? else

????????????p ++ ;

????}

???? return ?maxCount;

}

int ?main()?????

{??

???? char ? * p[ 3 ] =

???? {

???????? " String(1)8818882348888856788888888988888888880 " ,

???????? " String(2)881888234888885678888888898888888880 " ,

???????? " String(3)8818882348888856788888888988888888888888880 "

????} ;

???? int ?location? = ? 0 ;

???? char ?searchChar? = ? ' 8 ' ;

???? int ?tempCount? = ? 0 ;

???? int ?maxCount? = ? 0 ;

???? for ( int ?i? = ? 0 ;i < sizeof (p) / sizeof ( * p);i ++ )

???? {

????????tempCount? = ?GetMaxCountofContinuousLetter(p[i],searchChar);

???????? if (?tempCount? > ?maxCount)

???????? {

????????????maxCount? = ?tempCount;

????????????location? = ?i;

????????}

????}

????cout << " the?string?of?maxCount?is?:? " << p[location] << endl;

????cout << " the?count?of??the?continuous?letters?is?:? " << maxCount << endl;

????cin. get ();

}

posted on 2008-04-02 09:30 snowball 閱讀(315) 評(píng)論(0) 編輯收藏引用所屬分類: 算法＋數(shù)據(jù)結(jié)構(gòu)

只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
【推薦】100%開源！大型工業(yè)跨平臺(tái)軟件C++源碼提供，建模，組態(tài)！

相關(guān)文章: 銀行家算法求得含有最多連續(xù)特定字符個(gè)數(shù)的字符串排序從str中刪除remove中含有的字符 Write a routine that prints out a 2-D array in spiral order 100扇門，100個(gè)人，第i個(gè)人經(jīng)過(guò)門號(hào)可以整除i的門。經(jīng)過(guò)時(shí)，如果門開就關(guān)，如果門關(guān)就開。問(wèn)最后所有門的狀態(tài)是什么。統(tǒng)計(jì)1的個(gè)數(shù) 全排列的生成算法進(jìn)制轉(zhuǎn)換程序

網(wǎng)站導(dǎo)航: 博客園 IT新聞 BlogJava 博問(wèn) Chat2DB 管理

C++ Jounior

求得含有最多連續(xù)特定字符個(gè)數(shù)的字符串

導(dǎo)航

留言簿(1)

隨筆分類

友情鏈接

搜索

最新隨筆

最新評(píng)論

閱讀排行榜