Leetcode1-100: 14. Longest Common Prefix

最新推荐文章于 2022-05-21 00:53:11 发布

Y123iwantit

最新推荐文章于 2022-05-21 00:53:11 发布

阅读量148

点赞数

分类专栏： leetcode日记文章标签：字符串算法 leetcode

本文链接：https://blog.csdn.net/Y123iwantit/article/details/106172204

版权

leetcode日记专栏收录该内容

44 篇文章 0 订阅

订阅专栏

Leetcode1-100: 14. Longest Common Prefix

问题描述

问题描述

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.

这题的要求是输入一个字符串数组，给出所有字符串最长的相同开头子串。

解题思路

这题比较简单，直接暴力做就可以。

代码实现

    public String longestCommonPrefix(String[] strs) {
        int len = strs.length;
        if(len == 0) return "";
        int maxLen = strs[0].length();
        for(int i = 0; i < maxLen; i++) {
            char c = strs[0].charAt(i);
            for(int j = 1; j < len; j++) {
            	//遇到结尾或者直接遇到不一样的字符就结束
                if(i >= strs[j].length() || c != strs[j].charAt(i)) {
                    return strs[0].substring(0, i);
                }
            }
        }
        return strs[0];
    }