Number of Strings That Appear as Substrings in Word LeetCode solution in C++

1
class Solution {
2
 public:
3
  int numOfStrings(vector<string> &patterns, string word) {
4
    int count = 0;
5
    for (int i = 0; i < patterns.size(); i++) {
6
      if (word.find(patterns[i]) != string::npos) count++;
7
    }
8
    return count;
9
  }
10
};