【Longest Common Prefix】-（Java）

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: strs = ["flower","flow","flight"]
Output: "fl"

Example 2:

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

Example 3:

Input: strs = ["a"]
Output: "a"
Explanation: There is no common prefix among the input strings.

Constraints:

• 1 <= strs.length <= 200
• 0 <= strs[i].length <= 200
• strs[i] consists of only lower-case English letters.

class Solution {
    public String longestCommonPrefix(String[] strs) {
        String one = strs[0];
        String prefix = "";
        for (int i = 0; i < one.length(); i++) {
            for (int j = 0; j <= strs.length - 1; j++) {
                if (strs[j].length() > i) {
                    if (strs[j].charAt(i) != (one.charAt(i))) {
                        return prefix;
                    } else if (j == strs.length - 1) {
                        prefix = prefix.concat(new Character(one.charAt(i)).toString());
                    }
                } else {
                    return prefix;
                }
            }
        }
        return prefix;
    }
}