Leetcode Index

925.Long Pressed Name

925.Long Pressed Name


Your friend is typing his name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 1 or more times.

You examine the typed characters of the keyboard. Return True if it is possible that it was your friends name, with some characters (possibly none) being long pressed.

Example 1:
Input: name = "alex", typed = "aaleex"
Output: true
Explanation: 'a' and 'e' in 'alex' were long pressed.
Example 2:
Input: name = "saeed", typed = "ssaaedd"
Output: false
Explanation: 'e' must have been pressed twice, but it wasn't in the typed output.
Example 3:
Input: name = "leelee", typed = "lleeelee"
Output: true
Example 4:
Input: name = "laiden", typed = "laiden"
Output: true
Explanation: It's not necessary to long press any character.
name.length <= 1000
typed.length <= 1000
The characters of name and typed are lowercase letters.


class Solution {
bool isLongPressedName(string name, string typed) {
if(typed.length()<name.length()) return false;
int start=0;
for(int i=0;i<typed.size();i++)
if(typed[i]!=name[start]) return false;
else if(i<typed.size()-1 && typed[i] == typed[i+1]){
if(start<name.size()-1 && name[start] == name[start+1])
return start==name.size();

执行用时 :0 ms, 在所有 C++ 提交中击败了100.00%的用户 内存消耗 :8.5 MB, 在所有 C++ 提交中击败了77.52%的用户