LeetCode 127 单词接龙

单词接龙 时间超时web class Solution { public: bool isvalue(string s1, string s2) { int len = s1.size(); int count = 0; for (int i = 0; i<len; ++i) { if (s1[i] != s2[i]) ++count; } if (count ==
相关文章
相关标签/搜索