Skip to content

最长公共前缀 #39

Open
Open

Description

@CodeRookie262

编写一个函数来查找字符串数组中的最长公共前缀。

如果不存在公共前缀,返回空字符串 ""。

示例 1:

输入:strs = ["flower","flow","flight"]
输出:"fl"

示例 2:

输入:strs = ["dog","racecar","car"]
输出:""
解释:输入不存在公共前缀。

提示:

0 <= strs.length <= 200
0 <= strs[i].length <= 200
strs[i] 仅由小写英文字母组成

来源:LeetCode

Activity

  1. CodeRookie262 commented on Feb 23, 2021

    @CodeRookie262
    OwnerAuthor

    逐一项对比

    var longestCommonPrefix = function(strs) {
        if(strs.length === 0) return '';
        var ans = strs[0]; // 默认第一项为最长前缀
    
        for(var i = 1;i < strs.length;i++){
            for(var j = 0;j < Math.max(ans.length, strs[i].length);j++){
                if(ans[j] !== strs[i][j]){
                    ans = ans.slice(0,j);
                    break;
                }
            }
        }
        return ans;
    };

    逐一字符串对比

    var longestCommonPrefix = function(strs) {
        let ans = '';
        if(!strs.length) return ans;
    
        for(var i = 0;i < strs[0].length;i++){
            for(var j = 1;j < strs.length;j++){
                if(strs[0][i] !== strs[j][i]){
                    return ans;
                }
            }
            ans += strs[0][i]
        }
    
        return ans;
    };
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions