查找字符串数组中的最长公共前缀----java

编写一个函数来查找字符串数组中的最长公共前缀。

如果不存在公共前缀，返回空字符串 ""。

示例 1:
输入: ["flower","flow","flight"]
输出: "fl"

示例 2:
输入: ["dog","racecar","car"]
输出: ""
解释: 输入不存在公共前缀。

import java.util.Scanner;

public class LongestCommonPrefix {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("请输入三个字符串：");
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();
        String s3 = sc.nextLine();
        int a = 0;
        if (s1.length() <= s2.length() && s1.length() <= s3.length()) {
            a = s1.length();
        } else if (s2.length() <= s1.length() && s2.length() <= s3.length()) {
            a = s2.length();
        } else if (s3.length() <= s1.length() && s3.length() <= s2.length()) {
            a = s3.length();
        }
        for (int i = 0; i <= a; i++) {
            boolean b = (s1.charAt(i) + "").equals(s2.charAt(i) + "") && (s1.charAt(i) + "").equals(s3.charAt(i) + "") && (s2.charAt(i) + "").equals(s3.charAt(i) + "");
            if (b == false) {
                a = i - 1;
                if (a == -1) {
                    System.out.println("不存在公共前缀");
                } else {
                    System.out.print("公共前缀是：");
                    for (int j = 0; j <= a; j++) {
                        System.out.print(s1.charAt(j) + "");
                    }
                    break;
                }
            }
        }
    }
}