如何從n個字符串中找到子字符串

Question

我試圖用N個數組搜索兩個字符串的匹配字符，然後將子字符串與其餘字符串進行比較。這裏的代碼：

int main() 
{ 
    int a, b, n; 
    char sir[50]; 
    printf("Number of strings: "); scanf("%d", &n); 
    if(n<=1){ 
     printf("The program cannot run without at least 2 strings!"); 
    } else { 
     printf("The program will run for %d strings.\n", n); 
     printf("\nString number 1: "); 
     scanf("%s", &sir); 
     std::string first(sir); 
     cout << first; 
     for(a=2; a<=n;){ 
      printf("\nString number %d: ", a); 
      scanf("%s", &sir); 
      std::string temp(sir); 
      if(!!!first.contains(temp)!!!){ 
       a++; 
      } else { 
      printf("Program stops the substring doesn't match with the last string."); 
      return 0; 
      } 
     } 
    } 
} 

我在哪裏把!!!我不知道如何編碼那部分。

Answer 1

只是爲了回答你的問題：你爲什麼不使用'的std :: cout`和'的std :: cin`

if(first.find(temp) != std::string::npos)