码迷,mamicode.com
首页 > 其他好文 > 详细

(Easy) Long Pressed Name LeetCode

时间:2019-08-23 00:26:41      阅读:135      评论:0      收藏:0      [点我收藏+]

标签:amp   div   put   NPU   ||   tpc   pcc   else   when   

Description:

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.

 

Note:

  1. name.length <= 1000
  2. typed.length <= 1000
  3. The characters of name and typed are lowercase letters.

 

 

Solution:

class Solution {
    public boolean isLongPressedName(String name, String typed) {
        
       
        if(name ==null || typed ==null||typed.length()<name.length()){
            
            return false;
        }
        
        int tpcc=0;
        int namecc=0;
        for(int i = 0; i< name.length(); i++){
            
            if(Count(typed, name.charAt(i),tpcc)< Count(name, name.charAt(i),namecc)){
                return false;
            }
            
            tpcc= tpcc+Count(typed, name.charAt(i),tpcc);
            namecc= namecc+Count(name, name.charAt(i),namecc);
        }
        
        //System.out.println(Count("alexa", ‘a‘,0));
        return true;
    }
    
    
    public int Count (String s, char a, int pos){
        
        int num = 0;
        
        for(int i =pos; i<s.length(); i++){
            
            if(s.charAt(i)==a){
                
                num++;
            }
            else {
                
                break;
            }
        }
        
        return num;
    }
}

 

(Easy) Long Pressed Name LeetCode

标签:amp   div   put   NPU   ||   tpc   pcc   else   when   

原文地址:https://www.cnblogs.com/codingyangmao/p/11397248.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!