没啥说的直接上代码:
public class 找m和n的索引 {
public static void main(String[] args) {
int[] arr = {1,2,4,7,10,11,7,12,6,7,16,18,19};
int[] ret = findIndex(arr);
System.out.println(Arrays.toString(ret));
String[] strings = {"abc","ab"};
String s1 = longestCommonPrefix(strings);
System.out.println(s1);
}
public static String longestCommonPrefix(String[] str) {
if(str==null || str.length==0) {
return null;
}
StringBuilder sb = new StringBuilder();
Arrays.sort(str);
String s1 = str[0];
String s2 = str[str.length-1];
for (int i = 0;i < s1.length();i++) {
if (s2.length() > i && s2.charAt(i) == s1.charAt(i)) {
sb.append(s1.charAt(i));
}else {
return sb.toString();
}
}
return sb.toString();
}
public static int[] findIndex(int[] array) {
int[] temp = array.clone();
Arrays.sort(temp);
int left = -1;
int right = -1;
for (int i = 0;i < array.length;i++) {
if (array[i]!=temp[i]) {
if (left == -1) {
left = i;
}
right = i;
}
}
return new int[]{left,right};
}
}