java中将一维数组a[]中不相同的数按从小到大的序重新存于一组数组a[]中,在线等,
package day02;
public class A {
public static void main(String[] args) {
int a[]={15,7,15,6,4,3,4,6,7};
int i,j,k,low,high,mid,t;
for(i=k=1;i<a.length;i++){
low=0;
high=k-1;
while(..){//需写
mid=(low+high)/2;
if(a[mid]>a[i]){
..//需写
}else low=mid+1;
if( ... || a[low]!=a[i]){//需写
t=a[i];
for(j=k-1;...;j--){//需写
a[j+1]=a[j];
...//需写
}
k++;
}
}
for(j=0;j<k;j++){}
System.out.println(a[j]);
}
}
}
//上面的程序中,编写将一维数组a[]中不相同的数按从小到大的序重新存于一组数组a[]中,
其中...是需要写的程序,共5处需写,大家帮我看下,thanks
[解决办法]
int a[]={15,7,15,6,4,3,4,6,7};
Arrays.sort(a);
[解决办法]
别人实现好的一段代码,然后擦掉一些关键步骤让人补充:WLGQ。。。
这你在哪看到的?是什么排序算法有说么?
[解决办法]
public static void main(String[] args){
Integer a[]={15,7,15,6,4,3,4,6,7};
a = new TreeSet<>(Arrays.asList(a)).toArray(new Integer[1]);
System.out.print(Arrays.toString(a));
}
public class B
{
public static void main(String[] args)
{
int[] a ={15,7,15,6,4,3,4,6,7};
int i,j,k,low,high,mid,t;
for(i = k = 1;i<a.length;i++){
low = 0;
high = k-1;
while(low<=high){ //1
mid = (low+high);
if(a[mid]>a[i]){
high = mid-1;// 2
}else{
low = mid+1;
}
}
if( i<a.length
[解决办法]
a[low]!=a[i]){ //3
t = a[i];
for(j = k-1;j>=low;j--){ // 4
a[j+1]=a[j];
a[low]=t;//5
}
k++;
}
//}
}
for(j = 0;j<a.length;j++){
System.out.println(a[j]);
}
}
}