8/11 符号串处理

平衡括号字符串的最少插入次数

遇到左括号，需要的右括号加2，如果右括号是奇数，右括号加一，need–；遇到括号，先判断need是否有剩余，有的话就–，没有的话，左括号需要加一个，need = 1

var minInsertions = function(s) {
    let result = 0
    let need = 0
   for(let idx =0;idx<s.length;idx++) {
        if(s[idx] === '(') {
            need+=2
            if(need%2) {
                result++
                need--
            }
        }
        else {
            if(need==0) {
                result++
                need = 1
            }
            else need--

        }
    }
    return result + need

};

有效的括号

var isValid = function(s) {
    let value
    const stack = []
    for(let idx =0;idx<s.length;idx++){
        value = s[idx]
        if(value === '('|| value === '[' || value === '{' ){
            stack.push(value)
        }
        else{
            let valueLeft = stack.pop()
            console.log(value,valueLeft)
        if(value===')' && valueLeft !=='(') {
            return false
        }
        if(value===']' && valueLeft !=='[') {
            return false
        }
                if(value==='}' && valueLeft !=='{') {
            return false
        }
        }
    }
    return stack.length>0?false:true
};




var minAddToMakeValid = function(s) {
    const left = ['(','[','{']
    const right = [')',']','}']
    const stack = []
    const getRight = (value)=> {
        if(value === '{') return '}'
        if(value === ' (') return ')'
        return  ']'
    }
    for(let idx = 0;idx <s.length;idx++ ) {
        if(s[idx] in left ) {
            stack.push(s[idx])
        }
        else if(s[idx] in right) {
            if(getRight(s[idx]) !== stack.pop()) {
                return false
            }
        }
    }
    return stack.length>0?false:true
};

使括号有效的最少添加

var minAddToMakeValid = function(s) {
    let acc=0,need =0
    for(let idx = 0;idx<s.length;idx++) {
        if(s[idx]==='(') {
            need++
        }
        else if(s[idx] === ')') {
            need--
            if(need === -1) {
                acc++
                need++
            }
        }
        else {
            if(need===0) {
                acc++
                need++
            }
        }
    }
    return need+acc
};