leetcode-14. Longest common prefix JS longitudinal scanning method

subject

Code

/** * @param {string[]} strs * @return {string} */
//  Longitudinal scanning method 
var longestCommonPrefix = function(strs) {
    
    let strLen = strs[0].length; //  The length of the first element 

    //  Traverse the first element 
    for (let i = 0; i < strLen; i++) {
    
        let str = strs[0][i];

        //  Traverse the entire array 
        for (let j = 0; j < strs.length; j++) {
    
            if (strs[j][i] !== str) {
     //  If there is a different character , Then exit the loop 
                return strs[j].slice(0, i);
            }
        }
    }

    //  End of cycle , Describe each character in the first element of the array , Other elements of the array have ,
    //  At this point, the first element of the array has been traversed , So this element is the longest common prefix 
    return strs[0]; 
};