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

推荐订阅源

N
News and Events Feed by Topic
S
SegmentFault 最新的问题
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Last Week in AI
Last Week in AI
Jina AI
Jina AI
H
Help Net Security
C
Check Point Blog
aimingoo的专栏
aimingoo的专栏
MyScale Blog
MyScale Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Vercel News
Vercel News
L
LangChain Blog
Recorded Future
Recorded Future
F
Full Disclosure
Google DeepMind News
Google DeepMind News
Microsoft Security Blog
Microsoft Security Blog
I
InfoQ
GbyAI
GbyAI
B
Blog RSS Feed
T
The Blog of Author Tim Ferriss
Engineering at Meta
Engineering at Meta
A
About on SuperTechFans
M
MIT News - Artificial intelligence
爱范儿
爱范儿
V
V2EX
Microsoft Azure Blog
Microsoft Azure Blog
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
Y
Y Combinator Blog
B
Blog
WordPress大学
WordPress大学
Blog — PlanetScale
Blog — PlanetScale
W
WeLiveSecurity
MongoDB | Blog
MongoDB | Blog
Cloudbric
Cloudbric
N
News and Events Feed by Topic
The Cloudflare Blog
月光博客
月光博客
博客园 - 三生石上(FineUI控件)
有赞技术团队
有赞技术团队
D
DataBreaches.Net
博客园 - 【当耐特】
T
Troy Hunt's Blog
V
Visual Studio Blog
V2EX - 技术
V2EX - 技术
Apple Machine Learning Research
Apple Machine Learning Research
博客园 - 司徒正美
Recent Commits to openclaw:main
Recent Commits to openclaw:main
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Google Online Security Blog
Google Online Security Blog
The GitHub Blog
The GitHub Blog

博客园 - 司徒正美

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 925. Long Pressed Name 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 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 844. Backspace String Compare
司徒正美 · 2020-01-01 · via 博客园 - 司徒正美

比较两个带退格键的字符串

方法1, 从后往前遍历,记录要忽略掉的字符

var backspaceCompare = function(S, T) {
    return getMormalString(S) === getMormalString(T)
};

function getMormalString(S){
     var eat = 0, sb = []
     for(var i = S.length-1; i>=0 ; i--){
         if(S[i] == '#'){
             eat++
         }else{
             if(eat > 0){
                 eat--
             }else{
                 sb.push(S[i])
             }
         }
     }
    return sb.join('')
}

方法2, 使用栈,从前往后处理

var backspaceCompare = function(S, T) {
     if (!S || !T || S.length === 0 || T.length === 0) {
        return false;
    }
    
    let stackS = [];
    let stackT = [];
    
    for (let i = 0; i < S.length; i++) {
        if (S[i] !== '#') {
            stackS.push(S[i]);
        } else {
            stackS.pop();
        }
    }
    
    for (let i = 0; i < T.length; i++) {
        if (T[i] !== '#') {
            stackT.push(T[i]);
        } else {
            stackT.pop();
        }
    }
    
    if (stackS.length !== stackT.length) {
        return false;
    } else {
        for (let i = 0; i < stackS.length; i++) {
            if (stackS[i] !== stackT[i]) {
                return false;
            }
        }
    }
    return true;
}

方法3,使用归并排序合并数组的形态,从后往前比较

var backspaceCompare = function(S, T) {
    let sPointer = S.length - 1;
    let tPointer = T.length - 1;
    let sBackspaces = 0;
    let tBackspaces = 0;

    while (sPointer >= 0 || tPointer >= 0) {
        if (S[sPointer] === '#') {
            sBackspaces++;
            sPointer--;
            continue;
        }
        
        if (T[tPointer] === '#') {
            tBackspaces++;
            tPointer--;
            continue;
        }
        
        if (sBackspaces > 0) {
            sBackspaces--;
            sPointer--;
            continue
        }

        if (tBackspaces > 0) {
            tBackspaces--;
            tPointer--;
            continue;
        }

        if (S[sPointer] !== T[tPointer]) {
            return false;
        }
        
        sPointer--;
        tPointer--;
    }
    
    return true;
};