c++ - 匹配数组中的确切位置

Question

我能够创建一个函数来搜索并返回单词中的多个匹配字符，但现在我无法创建另一个函数来搜索两个单词是否完全匹配到位置并返回数字的比赛。约束是 c 字符串。所以如果一个词很小，我输入了 tine，它应该返回 3。

我在下面附加的功能只是我能够弄清楚的功能

int countMatches(const char s1[], const char s2[])
{    
  char s1copy[MAXWORDLEN+1];
  strcpy(s1copy, s1);

  int nMatches = 0;

  // For every character in s2

  for (int k2 = 0; s2[k2] != '\0'; k2++)
  {
    // For every character in the copy of s1

    for (int k1 = 0; s1copy[k1] != '\0'; k1++)
    {
        // If they match, blot it out of the copy of s1
        // so it won't be matched again

        if (s1copy[k1] == s2[k2])
        {
            nMatches++;
            s1copy[k1] = '#';
            break;
        }
    }
  }
  return nMatches;
}

Answer 1

int countMatches(const char s1[], const char s2[]) {
  int i = 0;
  while (s1[i] != '\0' && s2[i] != '\0' && s1[i] == s2[i])
    i++;
  return i;
}