惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Vercel News
Vercel News
F
Fortinet All Blogs
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
GbyAI
GbyAI
MongoDB | Blog
MongoDB | Blog
Jina AI
Jina AI
aimingoo的专栏
aimingoo的专栏
I
InfoQ
IT之家
IT之家
罗磊的独立博客
Blog — PlanetScale
Blog — PlanetScale
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
The Cloudflare Blog
爱范儿
爱范儿
Microsoft Azure Blog
Microsoft Azure Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
美团技术团队
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
B
Blog RSS Feed
G
Google Developers Blog
大猫的无限游戏
大猫的无限游戏
博客园_首页
Engineering at Meta
Engineering at Meta
Martin Fowler
Martin Fowler

博客园 - 司徒正美

leetcode 91. Decode Ways leetcode 1214 Two Sum BSTs leetcode 213 House Robber II leetcode 198 House Robber I leetcode 986. Interval List Intersections leetcode 869. Reordered Power of 2 leetcode 457. Circular Array Loop leetcode 1093. Statistics from a Large Sample leetcode 881. Boats to Save People leetcode 977. Squares of a Sorted Array leetcode 844. Backspace String Compare leetcode 1032. Stream of Characters leetcode 1023. Camelcase Matching leetcode 745 Prefix and Suffix Search leetcode 720. Longest Word in Dictionary leetcode 692. Top K Frequent Words leetcode 677. Map Sum Pairs leetcode 676. Implement Magic Dictionary leetcode 648. Replace Words
leetcode 925. Long Pressed Name
司徒正美 · 2020-01-09 · via 博客园 - 司徒正美

判定是否长按

var isLongPressedName = function (name, typed) {
            var i = 1, j = 0, n = name.length, m = typed.length;
            var last = name[0], iCount = 1
            while (i < n || j < m) {
                var el = name[i];
                if (el !== last) {
                    if (iCount !== 0) {
                        let jCount = 0
                        // console.log("j", j, m)
                        while (j < m) {
                            console.log("内循环", last, typed[j], j)
                            if (typed[j] !== last) {
                                break //跳到外循环
                            }
                            j++
                            jCount++
                        }

                        if (jCount < iCount) {
                            return false
                        }
                        if (j == m && i < n) {
                            return false
                        }
                    }
                    last = el
                    iCount = 1
                } else {
                    console.log("累加", el)
                    iCount++
                }
                i++
            }
            return true

        };

        console.log(isLongPressedName("alex", "aaleex"))
        console.log(isLongPressedName("saeed", "ssaaedd"))
        console.log(isLongPressedName("pyplrz", "ppyypllr"))

更精简的实现

var isLongPressedName = function(name, typed) {
    let j = 0;
    
    for (let i = 0; i < typed.length; i++) {
        if(name[j] == typed[i]) j++;
    }
    
    return j == name.length;
};

另一个

var isLongPressedName = function (name, typed) {
       let nlen = name.length, tlen = typed.length;
        if (nlen > tlen) return false;
        
        let i = 0, j = 0;
        while (i < nlen && j < tlen) {
            let  nc = name.charAt(i);
            let  tc = typed.charAt(j);
            if (nc == tc) {
                i++;
                j++;
            } else {
                if (j == 0 || tc != typed.charAt(j - 1)) {
                    return false;
                }
                j++;
            }
        }
        
        return i == nlen;
 
};