C++計數問題 [20點贈送!]
我要求出以下各個數字各有幾筆1112223334445556667778889101112131415161717171818181819191920202021212121222222232323232424242425252525252626272727282829292930303030313131...顯示更多我要求出以下各個數字各有幾筆11122233344455566677788891011121314151617171718181818191919202020212121212222222323232324242424252525252526262727272828292929303030303131313232323333343435353536363636373737373838383839393939404041414142424343444444444545454646464747474848484849494950505152525253535354545455555555565656565656575757585858595959596060606061616161626262626363646464646565656666666767676767686868686868696969707070707071717171727272737373747474747575757676777777777878787879797980808081818181828282828383838384848484848485858585858686868687878788888889898989898990909090909191919191919292929293939393949494949595959596969697979798989999999999100100100101101101101102102102103103103104104105105105105105106106106107107107108108108109109109109110110110111111111112112112113113113113114114114114115115115115116116116117117117118118118118119119119119120120120121121121122122122123123123124124124124125125125126126126127127127127128128128129129129130130130131131131132132132133133133133134134134134135135135136136136136137137137138138138139139139======================================我的程式碼是://A[]路徑矩陣讀取intA[139]={0};intvaule[];<=======顯示是錯誤的k=1;for(i=1;i<=node;i++)<=======顯示是錯誤的{if(fn[i]==fn[i+1])count=count+1;vaule[K]=fn[i];<=======顯示是錯誤的else<=======顯示是錯誤的A[K]=count;count=0;}請幫我看看哪裡有問題!
#include
#include using namespace std; main() { int data[] = { 1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,10,11,12,13,14,15,16,17,17,17,18,18,18,18,19,19, 19,20,20,20,21,21,21,21,22,22,22,23,23,23,23,24,24,24,24,25,25,25,25,25,26,26,27,27,27,28,28,29,29, 29,30,30,30,30,31,31,31,32,32,32,33,33,34,34,35,35,35,36,36,36,36,37,37,37,37,38,38,38,38,39,39,39, 39,40,40,41,41,41,42,42,43,43,44,44,44,44,45,45,45,46,46,46,47,47,47,48,48,48,48,49,49,49,50,50,51, 52,52,52,53,53,53,54,54,54,55,55,55,55,56,56,56,56,56,56,57,57,57,58,58,58,59,59,59,59,60,60,60,60, 61,61,61,61,62,62,62,62,63,63,64,64,64,64,65,65,65,66,66,66,67,67,67,67,67,68,68,68,68,68,68,69,69, 69,70,70,70,70,70,71,71,71,71,72,72,72,73,73,73,74,74,74,74,75,75,75,76,76,77,77,77,77,78,78,78,78, 79,79,79,80,80,80,81,81,81,81,82,82,82,82,83,83,83,83,84,84,84,84,84,84,85,85,85,85,85,86,86,86,86, 87,87,87,88,88,88,89,89,89,89,89,89,90,90,90,90,90,91,91,91,91,91,91,92,92,92,92,93,93,93,93,94,94, 94,94,95,95,95,95,96,96,96,97,97,97,98,98,99,99,99,99,99,100,100,100,101,101,101,101,102,102,102, 103,103,103,104,104,105,105,105,105,105,106,106,106,107,107,107,108,108,108,109,109,109,109,110, 110,110,111,111,111,112,112,112,113,113,113,113,114,114,114,114,115,115,115,115,116,116,116,117,117, 117,118,118,118,118,119,119,119,119,120,120,120,121,121,121,122,122,122,123,123,123,124,124,124,124, 125,125,125,126,126,126,127,127,127,127,128,128,128,129,129,129,130,130,130,131,131,131,132,132,132, 133,133,133,133,134,134,134,134,135,135,135,136,136,136,136,137,137,137,138,138,138,139,139,139, 0 }; int i; int Value[140]; // 先把統計的陣列清空為 0 for(i = 0; i < 140; i++) Value[i] = 0; // 開始正式統計資料 for( i = 0; data[i] > 0; i++) { Value[ data[i] ]++; // <== 這個地方對新手來說有點難，你自己再思考一下，為什麼這樣寫 } // 螢幕輸出結果 for( i = 1; i < 140; i++) { cout<< i << "共有" << Value[i] << "筆資料" << endl; } system("PAUSE"); return 0; }
#include#includevoidsort(intLen,int*Number){inti,j,temp;for(i=0;iNumber[j])temp=Number[i],Number[i]=Number[j],Number[j]=temp;}intmain(intargc,char*argv[]){//=====START=====////儲存為一個文字檔，在d糟底下charfn[]="d:\data.txt";FILE*f;inti,counter=0;inttemp,*p,*pCtr,MAX;f=fopen(fn,"r");if(f!=NULL){//計算總資料數while(!feof(f)){fscanf(f,"%d",&temp);if(temp>0){counter++;}}//配置資料空間p=(int*)malloc(counter*sizeof(int));fseek(f,0,SEEK_SET);//讀入資料for(i=0;i
以上文章來自奇摩知識家，如有侵犯請留言告知
https://tw.answers.yahoo.com/question/index?qid=20070930000010KK04698