Today I have done leetcode's January LeetCoding Challenge with cpp.

January LeetCoding Challenge 9

Description

Counting Words With a Given Prefix

You are given an array of strings words and a string pref.

Return the number of strings in words that contain pref as a prefix.

A prefix of a string s is any leading contiguous substring of s.

Example 1:

Input: words = ["pay","attention","practice","attend"], pref = "at"
Output: 2
Explanation: The 2 strings that contain "at" as a prefix are: "attention" and "attend".

Example 2:

Input: words = ["leetcode","win","loops","success"], pref = "code"
Output: 0
Explanation: There are no strings that contain "code" as a prefix.

Constraints:

• 1 <= words.length <= 100
• 1 <= words[i].length, pref.length <= 100
• words[i] and pref consist of lowercase English letters.

Solution

class Solution {
public:
  int prefixCount(vector<string>& words, string pref) {
    int answer = 0;
    for(const auto &word : words) {
      if(word.length() < pref.length()) continue;
      bool same = true;
      for(int i = 0; i < pref.length() && same; ++i) {
        same = pref[i] == word[i];
      }
      answer += same;
    }
    return answer;
  }
};

// Accepted
// 95/95 cases passed (0 ms)
// Your runtime beats 100 % of cpp submissions
// Your memory usage beats 75.06 % of cpp submissions (13.1 MB)