2026-10-22 20:01:43
public static void main(String[] args) {
String[] s = new String[]{"abcfg","abef","abdgg"};
System.out.print("字符串数组为:");
for(String ss : s){
System.out.print(ss+",");
}
System.out.println();
//首先找出长度最小的字符串
String minStr = s[0];
for(int i = 0; i < s.length; i++){
if(minStr.length() > s[i].length()){
minStr = s[i];
}
}
System.out.println("长度最小的字符串:"+minStr);
String result = "";
//循环长度最小字符串的每个字符,如果每个字符串都包含了这个字符,那么结果就加上它
for(int i = 0; i < minStr.length(); i++){
char ch = minStr.charAt(i);
boolean b = true;
//循环数组,判断每个字符串是否包含ch这个字符
for(int j = 0; j < s.length; j++){
if(s[j].charAt(i) == ch){
}else{
b = false;
}
}
//都包含,结果加上该字符
if(b){
result += ch;
}
}
System.out.println("公共字符串:"+result);
}
望采纳
2026-05-14 07:25:56
public class Test {
public static void main(String[] args) {
String str = "abcd,abcd,abcdef";
String s = getMaxPrex(str);
System.out.println(s);
}
public static String getMaxPrex(String str){
String[] data = str.split(",");
int arrLen = data.length;
int minLen = data[0].length();
String minStr = data[0];
StringBuilder sb = new StringBuilder();
for(String s : data){
if(s.length() < minLen){
minLen = s.length();
minStr = s;
}
}
char c = 0;
int flag = 0;
for(int i=0;i<minLen;i++){
c = minStr.charAt(i);
flag = 0;
for(int j=0;j<arrLen;j++){
if(data[j].charAt(i) != c){
break;
}else{
flag++;
}
}
if(flag == arrLen){
sb.append(c);
}
}
return sb.toString();
}
}
2026-02-18 20:25:09
public class Demo {
public static String getStart(String[] str) {
String tmp = "";
boolean flag = true;
for(int i = 1; i < str[0].length() && flag; i++) {
tmp = str[0].substring(0, i);
for(int j = 1; j < str.length && flag; j++) {
if(!str[j].startsWith(tmp)) {
flag = false;
break;
}
}
}
return tmp.substring(0, tmp.length() - 1);
}
public static void main(String[] args) {
System.out.println(getStart(new String[]{"abcdef", "abc", "abckhi", "abcj180"}));
}
}