Longest Common Prefix

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

代码：

public class Solution_13{public static String longestCommonPrefix(String[] strs) {if(strs.length == 0)return "";if(strs.length == 1)return strs[0];int minlength = strs[0].length(), index;for(int i = 1; i < strs.length; i++)minlength = Math.min(minlength, strs[i].length());index = minlength;for(int i = 0; i < minlength; i++){for(int j = 1; j < strs.length; j++){if(strs[j].charAt(i) != strs[0].charAt(i)){index = i;break;}}if(index != minlength)break;}if(index == -1)return "";elsereturn strs[0].substring(0, index);    }public static void main(String[] args){// TODO Auto-generated method stubString[] strings = {"flower","flow","flight","fff"};System.out.println(longestCommonPrefix(strings));}}