14. Longest Common Prefix

Description:

Write a function to find the longest common prefix string amongst an array of strings.

My code:

/**
 * @param {string[]} strs
 * @return {string}
 */
var longestCommonPrefix = function(strs) {
    if(strs.length == 0) {
        return "";
    }
    let prefix = "", temp = "";
    let firstStrArr = strs[0].split("");
    for(let i = 0; i < firstStrArr.length; i++){
        temp += firstStrArr[i];
        for(let j = 1; j < strs.length; j++) {
            if(!strs[j].startsWith(temp)) {
                return prefix;
            }
        }
        prefix += firstStrArr[i];
    }
    return prefix;
};

Note: 以第一个字符串作为判断的依据，去判断后面的字符串是否以第一个字符的前几位为前缀即可