Algorithm——Longest Common Prefix

最新推荐文章于 2025-08-21 23:36:32 发布

weixin_34326558

最新推荐文章于 2025-08-21 23:36:32 发布

阅读量140

点赞数

CC 4.0 BY-SA版权

文章标签： javascript ViewUI

原文链接：http://www.cnblogs.com/bbcfive/p/11066862.html

博客提出一个问题，即编写函数求字符串数组中的最长公共前缀，若没有则返回空字符串。给出了示例，用JavaScript解答，虽运行速度达top11%，但内存使用较多，还有优化空间，内容转载自其他博客。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Q：

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

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

A:

JAVASCRIPT

/**
 * @param {string[]} strs
 * @return {string}
 */
var longestCommonPrefix = function(strs) {
    if (!strs.length) return '';
    if (strs.length == 1) return strs[0];
    
    var minest = 0;
    for (var i = 0; i < strs.length - 1; i++) {
        minest = Math.min(strs[i].length, strs[i+1].length);
    }

    var index = 0, longest = 0;
    while(index < minest) {
        for (var i = 0; i < strs.length - 1; i++) {

            if (strs[i][index] !== strs[i+1][index]) {
                longest = index;

                i = strs.length - 1
                index = minest
            } else {
                longest = index + 1;
            }
        }
        index++;
    }

    return strs[0].slice(0,longest);  
};