Leetcode 2185. Counts the string containing the given prefix

Here's an array of strings words And a string pref .

return words China and Israel pref As Prefix Number of strings .

character string s Of Prefix Namely s Any leading continuous string of .

Example 1：

 Input ：words = ["pay","attention","practice","attend"], pref = "at"
 Output ：2
 explain ： With  "at"  The prefix string has two , Namely ："attention"  and  "attend" .

Example 2：

 Input ：words = ["leetcode","win","loops","success"], pref = "code"
 Output ：0
 explain ： Does not exist to  "code"  String as prefix .
 

Tips ：

• 1 <= words.length <= 100
• 1 <= words[i].length, pref.length <= 100
• words[i] and pref It's made up of lowercase letters

Code:

class Solution {
    
public:
    int prefixCount(vector<string>& words, string pref) {
    
        
        int res=0;
        for(int i=0;i<words.size();i++)
        {
    
            if(words[i].find(pref)==0)
                res++;
        }
        return res;
    }
};