[leetcode, JS] 14. Longest Common Prefix

문제

문제 링크 : Longest Common Prefix

틀린 풀이

/**
 * @param {string[]} strs
 * @return {string}
 */
var longestCommonPrefix = function(strs) {
    let shortStr = strs[0]
    strs.forEach(el => {
        if(shortStr.length > el.length){
            shortStr = el
        }
    })
    let result = "";
    shortStr = shortStr.split('')
    let chk = 0
    shortStr.forEach(e => {
        strs.forEach(el => {
            if(el.includes(e)){
                chk ++
            }
        })
        if(strs.length === chk) result += e
        chk = 0
    })

    return result
};

• 연속된 string이여야 함

풀이

/**
 * @param {string[]} strs
 * @return {string}
 */
var longestCommonPrefix = function(strs) {
    let shortStr = strs[0]
    strs.forEach(el => {
        if(shortStr.length > el.length){
            shortStr = el
        }
    })
    let result = [];
    shortStr = shortStr.split('')
    let chk = 0
    shortStr.forEach((e,i) => {
        strs.forEach(el => {
            if(el[i] === e){
                chk ++
            }
        })
        strs.length === chk ? result.push(e) : result.push('')
        chk = 0
    })
    let answer = ""
    for(let i=0; i<result.length; i++){
        if(result[i] === '') break;
        answer += result[i]
    }
    
    return answer
};

1. 틀린 풀이에서 연속된 문자가 아닐 경우만 체크