leetcode:Longest Common Prefix 【Java】

来源:互联网 发布:80c51单片机引脚图 编辑:程序博客网 时间:2024/06/05 20:05

一、问题描述

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

二、问题分析

三、算法代码

public class Solution {    public String longestCommonPrefix(String[] strs) {        if(strs.length == 0 || strs[0].length() == 0){            return "";        }        int minlen = strs[0].length();        for(int i = 0; i <= strs.length - 1; i++){            minlen = Math.min(strs[i].length(), minlen);        }        for(int i = 0; i <= minlen - 1; i++){            for(int j = 1; j <= strs.length - 1; j++){                if(strs[0].charAt(i) != strs[j].charAt(i)){                    return strs[0].substring(0, i);                }            }        }        return strs[0].substring(0, minlen);    }}


0 0