Replacing a word in a sentence with a another word - c++

Question

i was working on this question but there is some weird error in it. The problem is in the "Replace" function. I have commented the problem in the code below.
I made three dynamic character arrays (sentence, word1, word2) and used cin.getline to input. What i want to do is that if :
sentence = "I like pizza",
word1 = "like", and
word2 = "hate"
then I want sentence = "I hate pizza".
Also this is my first time using stack overflow so if there is any problem with this thread please let me know. Your help will be greatly appreciated.
void Replace(char* s, char* w1, char* w2)
{
int lisw = 0; //lisw = letters in single word
bool found = false;
for (int i = 0; s[i] != '\0' || found == true; i++)
{
lisw = 0;
//Problem is down here. The loop doesn't terminate when encountering a
//space character. When i used static_cast code to check the ASCII
//values only junk values were output. If i just cout<<s; then there is
//no problem but doing it here causes some weird logical errors.
for (int j = i; s[j] != ' '; j++)
{
lisw++;
cout << static_cast<int>(s[j]);
}
found = true;
for (int j = i; j < lisw; j++)
{
if (s[j] != w1[j])
{
found = false;
}
}
if (found == true)
{
for (int j = i; j < lisw; j++)
{
s[j] = w2[j];
}
}
i = i + lisw;
}
}

Answer 1

Ok so i found a solution thanks to the comments. I'll copy the corrected code below. The corrections can be seen in the comments.
void Replace(char* s,char* w1, char* w2)
{
int lisw = 0; //lisw = letters in single word
bool found =false;
for (int i=0;s[i]!='\0' && found!=true;i++) //Replaced || with &&.
{
lisw=0;
for (int j=i;s[j]!=' '&& s[j]!='\0';j++)//added: && s[j]!='\0' so the loop terminates because otherwise it kept finding "spaces" since the character array was of a larger size to accommodate any sentence.
{
lisw++;
}
found=true;
int k=0;
for (int j=i;j<lisw+i;j++) //loop goes until lisw+i instead of lisw
{
if (s[j]!=w1[k])
{
found=false;
}
k++;
}
k=0;
if (found==true)
{
for (int j=i;j<lisw+i;j++)//same as above.
{
s[j]=w2[k];
k++;
}
}
i=i+lisw;
}
}