I need help in figuring out the logic or code to when I want my string not to fall in the middle of another string. For example my given word is "Birthday!" and the other string to look for it is "Happy Birthday Scott". It's going to return a false value because it's missing an exclamation point. Here is the code that I've worked

int Words::matchWords(const char* string, const char* sentence, int wordNum){
int wordCount = words(sentence); // the words function counts the number of words in the sentence
int strLength = strlen(str);
int sentLength = strlen(sentence);
int i = 0;

char strTemp[100];
char sentenceTemp[100];

strcpy(strTemp, str);
strcpy(sentenceTemp, sentence);

    if (wordNum > wordCount) {
        return false;
    }

    char* temp;
    for (i = 0; i < strLength; i  ) {
        strTemp[i] = tolower(str[i]);
    }
    for (i = 0; i < sentLength; i  ) {
        sentenceTemp[i] = tolower(str[i]);
    }

    temp = strstr(sentenceTemp, strTemp);

    if (temp != NULL) {
        return true;

        if (strTemp[i] != sentenceTemp[i]) { 
            return false;
        }
        else
            return true;

    }
    else
        return false;
}

CodePudding user response：

Here is a super simple program for you to look at.

All you have to do for this problem is create your strings using std::string, determine if they are inside the big string using find(), and lastly check if it was found using string::npos.

#include <iostream>
#include <string>

using namespace std;

int main()
{
    string bday = "Birthday!";

    string str1 = "Happy Birthday Scott";
    int found1 = str1.find(bday);
    
    string str2 = "Scott, Happy Birthday!";
    int found2 = str2.find(bday);

    if (found1 == string::npos) //if Birthday! is NOT found!
    {
        cout << "str1: " << "FALSE!" << endl;
    }
    
    if (found2 != string::npos) //if Birthday! IS found!
    {
        cout << "str2: " << "TRUE!" << endl;
    }
}

Note that for string::npos, you use == for something NOT being found and != for something that IS found.