Leetcode 14 Longest Common Prefix

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

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

在做题的过程中对于初值和值的带出方面出现了失误，导致调了2个小时的bug，以后要注意好细节，在细节上下功夫。

1）

class Solution {
    public String longestCommonPrefix(String[] strs) {
        if (strs == null || strs.length == 0)
            return "";
        int flag = strs[0].length();
        for(int i = 1 ; i < strs.length;i++){
            flag = Math.min(flag,strs[i].length());
        }
        int num = -1;
        for(int i = 0 ; i < flag;i++){
            boolean ff = false;
            char ss = strs[0].charAt(i);
            for(int j = 1 ; j < strs.length;j++){
                if(ss != strs[j].charAt(i)){
                    ff = true;
                    break;
                }
            }
            if(ff){
                break;
            }
            num = i;
        }
        return strs[0].substring(0,num+1);
    }
}

2）

class Solution {
    public String longestCommonPrefix(String[] strs) {
        if(strs.length == 0){
            return "";
        }
        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;
    }
}