lettcode 14 字符串最大公共前缀

lettcode 14 字符串最大公共前缀

//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.
// Related Topics 字符串

//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public String longestCommonPrefix(String[] strs) {
        if(strs.length == 0)
            return "";
        if(strs.length == 1)
            return strs[0];
        int temp = 100;
        String model;
        for(int i = 0; i + 1 < strs.length; i++) {
        	//str 替换成最短值
            int index = strs[i].length() > strs[i+1].length()
                    ? strs[i+1].length() : strs[i].length();
            temp = temp < index ? temp : index;
			//str 替换成最短有效值
            for(int j = 0; j < temp; j++) {
                if(strs[i].charAt(j) != strs[i+1].charAt(j)) {
                    temp = j;
                    break;
                }
            }
        }
        if (temp == 0)
            return "";
        return strs[0].substring(0, temp);
    }
}
//leetcode submit region end(Prohibit modification and deletion)

运行结果