LeetCode[14][easy] Longest Common Prefix

public class Solution {
    public String longestCommonPrefix(String[] strs) {
        if (strs.length == 0) {
			return "";
		}
		int minLength = Integer.MAX_VALUE;//最小长度设置为最大
		for (int i = 0; i < strs.length; i++) {
			if (minLength > strs[i].length()) {
				minLength = strs[i].length();
			}
		}
		int length = getSub(minLength, strs);
		String result = strs[0].substring(0, length+1);
		return result;
    }
	
	private int getSub(int minLength, String[] strs) {
		int length = 0;
		for (int j = 0; j < minLength; j++) {
			char compare = 0;
			for(int k = 0; k <strs.length; k++) {
				char[] arr = strs[k].toCharArray();
				if (arr[j] == compare || k==0) {
					compare = arr[j];
				} else {
					length = j-1;
					return length;
				}
			}
		} 
		return minLength-1;
	}
}

 

转载于:https://my.oschina.net/zhangtuoDMU/blog/1358601