题目:
随机产生10个随机数据,在1~100之间且不重复,需要得到这十个数字的最长连续递增子序列,例如产生的数据为{1,5,7,8,43,98,23,4,9,2},则最长连续递增子序列就为{5,7,8}。
public class Test {
public static void main(String[] args) {
//1,定义10个随机数
int[] num = {1,5,7,8,43,98,23,4,9,2};
//2,将数组变为字符串对象
String str_1 = arrayToString(num);
//3,打印原字符串
printString(str_1);
//4,将元素组进行排序,并变为字符串
String str_2 = newArrayToString(num);
//5,打印新的字符串
printString(str_2);
//6,得到最长连续递增子序列
String longstr = getLongString(str_1,str_2);
//7,打印得到的最长子序列
printString("["+longstr.substring(1,longstr.length()-1)+"]");
}
private static String getLongString(String str_1, String str_2) {
for (int i = 0; i < str_2.length(); i++) {
for (int a = 0 , b = str_2.length()-i; b!=str_2.length()+1; a++,b++) {
String sub = str_2.substring(a,b);
if(str_1.contains(sub)) {
return sub;
}
}
}
return null;
}
private static String newArrayToString(int[] num) {
Arrays.sort(num);
String str = arrayToString(num);
return str;
}
private static void printString(String str_1) {
System.out.println(str_1);
}
private static String arrayToString(int[] num) {
StringBuilder sb = new StringBuilder();
sb.append("[");
for (int i = 0; i < num.length; i++) {
if(i!=num.length-1)
sb.append(num[i]+",");
else {
sb.append(num[i]+"]");
}
}
return sb.toString();
}
}
运行结果: