LeetCode 14 最长公共前缀（难度：Easy）

最新推荐文章于 2021-10-27 20:05:45 发布

雨落本无晴

最新推荐文章于 2021-10-27 20:05:45 发布

阅读量194

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_33378853/article/details/89533409

版权

LeetCode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

题意大意：给出一个字符串数组，找出所有字符串的最长公共前缀。如果没有公共前缀，返回字符串：“”

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.

package pers.leetcode;

/**
 * LeetCode 14 Longest Common Prefix
 * 难易程度: Easy
 *
 * @author jinghui.zhu
 * @date 2019/4/26 10:18
 */
public class LongestCommonPrefix {

    public static void main(String[] args) {
        String[] strs = {"flower", "flow", "flight"};
        String commonPrefix = longestCommonPrefix(strs);
        System.out.println("最长公共前缀是: " + commonPrefix);
    }

    public static String longestCommonPrefix(String[] strs) {
        if (strs == null || strs.length == 0) {
            return "";
        }
        for (int i = 0; i < strs[0].length(); i++){
            char c = strs[0].charAt(i);
            for (int j = 1; j < strs.length; j++){
                if (i == strs[j].length() || strs[j].charAt(i) != c){
                    return strs[0].substring(0, i);
                }
            }
        }
        return strs[0];
    }
}