LeetCode OJ算法题（十四）：Longest Common Prefix

来源：互联网发布：unity3d游戏开发流程编辑：程序博客网时间：2024/06/14 11:13

题目：

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

解法：

遍历比较每个字符串字符与公共前缀字符，若终止是因为到Prefix的结束，则Prefix保持不变。若终止是因为字符不相符，则将到目前为止的子串作为Prefix更新。

public class No14_LongestCommonPrefix {public static void main(String[] args){System.out.println(longestCommonPrefix(new String[]{"aba","abacbb","abadf","abaddg"}));}    public static String longestCommonPrefix(String[] strs) {    if(strs.length == 0) return "";        String ret = strs[0];        for(int i=1;i<strs.length;i++){        int p = 0;        while(p<strs[i].length() && p<ret.length()){        if(strs[i].charAt(p) != ret.charAt(p)) break;        p++;        }        if(p != ret.length())        ret = strs[i].substring(0,p);        }    return ret;    }}

0 0