目录
1.使用冒泡排序,实现如下数组从小到大的排序
冒泡排序:重复相邻数字的比较
int[] arr=new int[]{34,55,22,-98,6,-76,0,-3};
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-i-1; j++) {
if(arr[j]>arr[j+1]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+"\t");
}
System.out.println(" ");
2.反转该数组
for (int i = 0; i < arr.length/2; i++) {
int temp=arr[i];
arr[i]=arr[arr.length/2-i-1];
arr[arr.length/2-i-1]=temp;
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+"\t");
}
System.out.println(" ");
3.复制该数组
int[] arr2=new int[arr.length];
for (int i = 0; i < arr2.length; i++) {
arr2[i]=arr[i];
}
for (int i = 0; i < arr2.length; i++) {
System.out.print(arr2[i]+"\t");
}
System.out.println(" ");
4.在该数组中查找22
int num=22;
boolean flag=true;
for (int i = 0; i < arr.length; i++) {
if(arr[i]==22){
System.out.println("该数值的索引位置是:"+i);
flag=false;
}
}
if(flag){
System.out.println("该数值不存在");
}
System.out.println(" ");
5.数组中的常见异常
- 空指针异常:NullOfIndex
- 数组角标越界异常:ArrayIndexOutOfBoundsException
- 合理范围:[0,arr.length-1]
- 越界:arr[-1],arr[arr.length]