Leetcode-09-solution

class Solution {
    public String longestCommonPrefix(String[] strs) {
        //首先计算给定数组的长度
        int strLength = strs.length;
        try {
            String prefix = strs[0];
            //一次计算每个字符，只要当前字符相等则继续，否则就取出当前的字符串
            for (int i = 0; i < strLength; i++) {
                while (strs[i].indexOf(prefix) != 0) {
                    prefix = prefix.substring(0, prefix.length()-1);
                    if (prefix.isEmpty()) {
                        return "";
                    }

                }
            }
            return prefix;
        } catch (Exception e) {
            return "";
        }
    }
}