java solution

class Solution {public String longestCommonPrefix(String[] strs) {if(strs == null || strs.length == 0) {return "";}//用第一个字符串作为模板,利用indexOf()方法匹配,由右至左逐渐缩短第一个字符串的长度String prefix = strs[0];for(int i = 1; i < strs.length; ++i) {while(strs[i].indexOf(prefix) != 0) {prefix = prefix.substring(0, prefix.length() - 1);}if(prefix.length() == 0) {return "";}}return prefix;}
}