[LeetCode-Java]14. Longest Common Prefix

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

解：注意数组的非空判断，以及字符串越界访问。

public class Solution {
    public String longestCommonPrefix(String[] strs) {
        StringBuilder result = new StringBuilder();
        //数组非空判断
        if (strs.length != 0 && strs != null) {

            int j = 0, minLength;
            Boolean flag = true;

            minLength = strs[0].length();
            //字符串最小长度
            for (int i = 1; i < strs.length; i++) {
                if (strs[i].length() < minLength) {
                    minLength = strs[i].length();
                }
            }


            while (j < minLength) {
                char a = strs[0].charAt(j);
                for (int i = 1; i < strs.length; i++) {

                    if (strs[i].charAt(j) != a) {

                        flag = false;
                        break;
                    }

                }

                if(!flag){
                    break;
                }

                j++;

                result.append(a);

            }
        }

        return result.toString();
    }
}