2 like 0 dislike
請依下列的定義完成函數。

 

#include <stdio.h>

 

///

///函數名稱 count

///函數功能 計算字串當中出現特定子字串的次數

///參數說明

///str 要被搜尋的字串

///key 子字串

///

int count(const char str[], const char key[]);

 

int main()

{

   char str[1000], key[1000];

   gets(str);

   gets(key);

   printf(“子字串共出現 %d 次”, count(str, key));

   return 0;

}

 

int count(const char str[], const char key[])

{

 

}
[Normal] Essay (Open question) - asked in 2017-1 程式設計(一)AD by (30k points)
Available when: Unlimited - Due to: Unlimited
| 56 views

5 Answers

0 like 0 dislike
Hidden content!
#include ** * ** *** *
#include * ** * ***

int * * *** * char str[], const char key[]);

int main()
{
***** ******** str[1000], key[1000];
* ** ** * * * * *
** ** ****** ** * * *
* *** ** * * ****** * * * **** * *** %d 次", count(str, key));
** ** ** ** *** * 0;
}

int ** ** ** char str[], const char key[])
{
* ** *** * * *** * * * *
** * * * * * **** * * *** key);
* ****** ** * * *** * * * * * ***
* * * ** ***** ** * *
**** ** * * ** * ***** ** ** **** ** *
* ** * * ** ** **** * ***** ** * ** *
* **** * *** ** * * ** ** ** ** *** ** ** * ** * *** ** key);
** ** * ** *** * ***
* * * * * * * * * ** ** count;
}
answered
0 like 0 dislike
Hidden content!
#include * * * * ******

#include * * ****** * * * *



int ***** char str[], const char key[]);



int main()

{
** **** * * *** str[1000], key[1000];
** **** * ** * ** ** * ** *
**** ** * ***** ** *
*** *** * * ** * * ***** ** * *** *** * %d * *** count(str, key));
***** * * * ** ** ** 0;

}



int count(const char str[], const char key[])

{
*** * * * ***** ** * ** *** * *****
** * * ** * * * * * * key);
* * * ** ** ****** *** ** ** **** **
** **** **** * **
***** * ** * ** * * ** * ** *** ** * * ** * * ***
**** *** ** * * *** ******* **** * * *** * **
* *** ** ** *** ** * * ***** * * *** * * key);
* * * * ** ** **** * **
* **** ** * **** *** **** count;

}
answered by (190 points)
0 like 0 dislike
Hidden content!
#include * * ** ** *
#include ** * * * *

int ** * char str[], const char key[]);

int main()
{
**** ** * *** * * * ***** str[1000], key[1000];
  * *** ****
  * * * * **
* ** * * * * * * * *** ** ** * %d ** * ** * key));
** *** * ** ** ** 0;
}

int * char str[], const char key[])
{
** *** * * * ******* ** * * *** ** ***
* * *** * *** *** ** **** ** ** * * key);
* ** * * * *** * **
* * ** *** ** ** ****
* ***** * * ** *** **** **** ******* * **
* *** ** * ** **** ** * ** *** **** * **
*** *** ** * * * ** ** * ** ***** ******** ** ** *** * * key);
* * ** * * ***** * * ***
** * ** *** ** * * * * * * count;
}
answered by (174 points)
edited by
0 like 0 dislike
Hidden content!
*** * ** ** * **



int ** char * * * * *



int **



{


** ** *** ** * ** * ** *** * ***


* **** * *** * * ** * **


* ** *** * ******


* *** * * ********** * *** * * %d ** ** ** * *** *** *


** * * * * ** ******** * 0;



}



int ** * char * ** * *** * *



{



int x=0;


*p;



do



{


* * * ** * *** * * * *** ** * *


*** ** * ** * * *** ** ** * ** != NULL)



{


* * ******** * * *** ** ** * ** ** *** *


* * **** ** *** ** * * * *** **** * *



}



}


* ***


* x;



}
answered by (160 points)
0 like 0 dislike
Hidden content!
#include *
#include ** *** ** * **

int ** char str[], const char key[]);

int main()
{
**** * *** ** ** ** str[1000], key[1000];
**** **** * **
***** ** ** * * ****
** ** **** ** ** * ** * ** * * %d 次", count(str, key));
* **** * * * * 0;
}

int **** * char str[], const char key[])
{
** * ** * *** *** ** *** * * * *
** ** **** ** * * * ** **** key);
* ** * ***** ** ** ** * *
*** * * **** * * *
** ** ** * * ** *** ** ** * * * ***
** * * * *** ** * * * * * ** * *** *** * *
* ** ** * **** * * * * * * * **** *** * * *** ** * key);
* * ** * **** * ** * *
* ** * ***** ** ** count;
}
answered by (30k points)
Get it on Google Play Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.68.65.252
©2016-2019

Related questions

2 like 0 dislike
8 answers
[Normal] Coding (C) - asked Dec 20, 2017 in 2017-1 程式設計(一)AD by 楊修俊 (30k points)
Available when: Unlimited - Due to: Unlimited
| 78 views
2 like 0 dislike
6 answers
[Normal] Coding (C) - asked Dec 20, 2017 in 2017-1 程式設計(一)AD by 楊修俊 (30k points)
Available when: Unlimited - Due to: Unlimited
| 65 views
2 like 0 dislike
5 answers
[Normal] Coding (C) - asked Dec 20, 2017 in 2017-1 程式設計(一)AD by 楊修俊 (30k points)
Available when: Unlimited - Due to: Unlimited
| 81 views
9,099 questions
79,707 answers
55,624 comments
2,453 users