809. Expressive Words
https://leetcode.com/problems/expressive-words/description/
class Solution { public: int expressiveWords(string S, vector<string>& words) { int res = 0; for (const auto& w : words) { if (check(S, w)) res++; } return res; } bool check(const string& s, const string& w) { int i = 0, j = 0, m = s.length(), n = w.length(); while (i < m && j < n) { if (s[i] != w[j]) return false; int ii = 1, jj = 1; while (++i < m && s[i] == s[i-1]) ii++; while (++j < n && w[j] == w[j-1]) jj++; if (ii < jj || ii < 3 && ii != jj) return false; } return i == m && j == n; } };
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步