常见算法-最长公共前缀

package string;

import java.util.Arrays;
import java.util.Scanner;

/**
 * @author : zhaoliang
 * @program :newCoder
 * @description : 最长公共前缀
 * @create : 2020/11/20 18:22
 */
public class LongChechStrs {
    //编写一个函数来查找字符串数组中的最长公共前缀。如果不存在，返回空字符串
    public static String replaceSpace(){
        String[] strs = new String[3];
        StringBuilder stringBuilder = new StringBuilder();
        Scanner scanner = new Scanner(System.in);

        for (int s = 0; s <strs.length ; s++) {
            strs[s] = scanner.nextLine();
        }
        if (!checkStr(strs)){
            return "";
        }
        Arrays.sort(strs);
        int m = strs[0].length();
        int n = strs[strs.length-1].length();
        int num = Math.min(m,n);

        for (int i = 0; i <num ; i++) {
            if (strs[0].charAt(i) == strs[strs.length-1].charAt(i)){
                stringBuilder.append(strs[0].charAt(i));
            }else {
                break;
            }
        }
        return stringBuilder.toString();
    }

    public static void main(String[] args) {
        System.out.println(replaceSpace());
    }
    private static boolean checkStr(String[] strs) {
        boolean falg = false;
        if (strs==null)
            return falg;
        int length = strs.length;
        for (int i = 0; i <length ; i++) {
            if (strs[i]!=null && strs[i].length()!=0){
                falg=true;

            }else {
                falg = false;
                break;
            }
        }
        return falg;
    }
}