【Leetcode_easy】925. Long Pressed Name

problem

925. Long Pressed Name

solution1:

class Solution {
public:
    bool isLongPressedName(string name, string typed) {
        int i=, m=name.size(), n=typed.size();
        for(int j=; j<n; ++j)
        {
            if(i<m && name[i]==typed[j]) i++;
            else if(!j && typed[j]!=typed[j-]) return false;
        }
        return i==m;
    }
};

参考

1. Leetcode_easy_925. Long Pressed Name;

2. discuss;

3. cnblogs;

完