C++ 求解：最少操作次数让字符串无子串 “friend”

```cpp #include <iostream> #include <string> int minOperations(std::string s) { int count = 0; for (size_t i = 0; i <= s.size() - 4; ++i) { if (s.substr(i, 4) == "friend") { s.replace(i, 4, "love"); count++; i = i + 3; } } return count; } int main() { std::string s; std::cin >> s; std::cout << minOperations(s) << std::endl; return 0; } ``` ######[AI写代码神器 | 153点数解答 | 2024-08-17 16:29:54]