62,612
社区成员
发帖
与我相关
我的任务
分享
public class Main {
public static void main(String[] args) {
int[] src = new int[1000];
Set<Integer> set = new HashSet<Integer>();
Random r = new Random();
for (int i = 0; i < 5; i++) {
set.add(r.nextInt(20));
}
for (int i = 0; i < src.length; i++) {
int j = r.nextInt(20);
if (!set.contains(j)) {
src[i] = j;
}
}
Arrays.sort(src);
src = g(src);
for (int i : src) {
System.out.print(i + " ");
}
System.out.println("\n" + src.length);
}
public static int[] g(int[] src) {
int k = 0;
while (src[k] < src[src.length - 1]) {
int x = Arrays.binarySearch(src, k + 1, src.length, src[k] + 1);
src[++k] = x > 0 ? src[x] : src[-x - 1];
}
return Arrays.copyOf(src, k + 1);
}
}
public class Sort1 {//排序
public static void sort(int[] arr){
for(int i = 0;i < arr.length;i++){
int k =i;
for(int j=k;j < arr.length;j++){
if(arr[j] < arr[k]){
k = j;
}
}
if(k != i){
int temp = arr[i];
arr[i] = arr[k];
arr[k] = temp;
}
}
}
public static int[] deleteMulti(int[] arr){//删除
int m = 0;
int n = 0;
while(m < arr.length){
arr[n] = arr[m];
while(arr[n] == arr[m]){
m++;
if(m == arr.length){
break;
}
}
n++;
}
int[] newNum = new int[n];
for(int i = 0;i < n; i++)
newNum[i] = arr[i];
return newNum;
}
public static void main(String[] args) {
int[] arr = {7,8,5,4,2,6,4,8,7,6,2,6,9};
sort(arr);
int[] newarr = deleteMulti(arr);//用一个数组存排序好的,算不算?
for(int i:newarr){
System.out.print(" " + i);
}
}
}
int[] arr = {7,8,5,4,2,6,4,8,7,6,2,6,9};
ArrayList<Integer> arrayList = new ArrayList<Integer>();
for (int i = 0; i < arr.length; i++) {
if (!arrayList.contains(arr[i])) {
arrayList.add(arr[i]);
}
}
Object[] aa =arrayList.toArray() ;
Arrays.sort(aa) ;
for (int i = 0; i < aa.length; i++) {
System.out.println(aa[i]);
}