C++ (Cpp) count_word_int_str_way_2_recursion示例

示例#1

文件： getFrequencyofWord.cpp 项目： varshikakamala/MissionRnD-C-Strings2-Worksheet

int count_word_int_str_way_2_recursion(char *str, char *word){
	if (str==NULL)	return 0;
	if (str[0] == word[0])
		return 1 + count_word_int_str_way_2_recursion(str, word);
	else
		return count_word_int_str_way_2_recursion(str, word);
}

示例#2

文件： getFrequencyofWord.cpp 项目： viashnavi/MissionRnD-C-Strings2-Worksheet

int count_word_int_str_way_2_recursion(char *str, char *word,int start,int len_word){
	if (str[start] == '\0'){
		return 0;
	}
	else{
		if (str != NULL && word != NULL){
			int flag = 0;
			int count = 0;
			if (str[start] == word[0]){
				for (int k = 1, m = start + 1; k < len_word; k++, m++){
					if (str[m] != word[k]){
						flag = 1;
						break;
					}
				}
				if (flag == 0){
					return count + count_word_int_str_way_2_recursion(str, word, start + 1, len_word);
				}
			}
			else{
				return count_word_int_str_way_2_recursion(str, word, start + 1, len_word);
			}
		}
	}
	return 0;
}

示例#3

文件： getFrequencyofWord.cpp 项目： vasanthi13/MissionRnD-C-Strings2-Worksheet

int count_word_int_str_way_2_recursion(char *str, char *word){
	if(str[i]=='\0')
		return c;
	else
	{
		for (k = 0; word[k] != '\0'; k++)
			len++;
		j = 0;
		while (j < len)
		{
			if (str[i] == word[j])
			{
				i++;
				j++;
			}
			else break;
		}
		if (j == len)
		{
			c++;
			i--;
			if (len>1)
			{
				if (str[i] == str[i - 1])
					i--;
			}
		}
		return  count_word_int_str_way_2_recursion(str, word);
	}
}

示例#4

文件： getFrequencyofWord.cpp 项目： kavya9/MissionRnD-C-Strings2-Worksheet

int count_word_int_str_way_2_recursion(char *str, char *word){
	if (str == NULL || word == NULL) return 0;
	int  i, flag;
	if (*str == '\0')
	{
		return 0;
	}
	i = 0, flag = 0;
	while (word[i] != '\0')
	{
		if (str[i] != word[i])
		{
			flag++;
			break;
		}
		i++;
	}
	if (!flag)
		return count_word_int_str_way_2_recursion(str + 1, word) + 1;
	else return count_word_int_str_way_2_recursion(str + 1, word);
}