package arry;
public class newAaay {
public static void main(String[] args) {
int[] arry = {90,23,45,19,23,12,12,12};
int[] b = trim(arry);
//进行排序 选择排序法
int index;
int value;
int temp;
for (int i = 0; i < b.length; i++) {
index = i;
value = b[i];
for (int j = i; j < b.length; j++) {
if(b[j]<value){
index = j;
value = b[j];
}
}
temp = b[i];
b[i] = b[index];
b[index] = temp;
}
for (int c : b) {
System.out.print(c+" ");
}
}
//去掉重复数据
private static int[] trim(int[] arry) {
int t = 0;
int[] newary = new int[arry.length];
for (int i = 0; i < arry.length; i++) {
boolean isTrue = true;
for (int j = i+1; j < arry.length; j++) {
if(arry[i] == arry[j]){
isTrue = false;
break;
}
}
if(isTrue){
newary[t] = arry[i];
t++;
}
}
int[] newArry = new int[t];
System.arraycopy(newary,0,newArry,0,t);
return newArry;
}
}
public class newAaay {
public static void main(String[] args) {
int[] arry = {90,23,45,19,23,12,12,12};
int[] b = trim(arry);
//冒泡排序法
int temp;
for (int i = 0; i < b.length; i++) {
for (int j = i; j < b.length; j++) {
if(b[i]<b[j]){
temp = b[j];
b[j] = b[i];
b[i] = temp;
}
}
}
//进行排序 选择排序法
int index;
int value;
int temp;
for (int i = 0; i < b.length; i++) {
index = i;
value = b[i];
for (int j = i; j < b.length; j++) {
if(b[j]<value){
index = j;
value = b[j];
}
}
temp = b[i];
b[i] = b[index];
b[index] = temp;
}
for (int c : b) {
System.out.print(c+" ");
}
}
//去掉重复数据
private static int[] trim(int[] arry) {
int t = 0;
int[] newary = new int[arry.length];
for (int i = 0; i < arry.length; i++) {
boolean isTrue = true;
for (int j = i+1; j < arry.length; j++) {
if(arry[i] == arry[j]){
isTrue = false;
break;
}
}
if(isTrue){
newary[t] = arry[i];
t++;
}
}
int[] newArry = new int[t];
System.arraycopy(newary,0,newArry,0,t);
return newArry;
}
}
本文介绍了如何使用Java进行数组元素的去重以及冒泡排序操作。通过冒泡排序算法,实现了数组从小到大的排列,提升了数据处理的效率。

被折叠的 条评论
为什么被折叠?



