- 练习一
- <数组升序>
import java.util.Arrays;
public class day9_01 {
public static void main(String[]args){
int[] number={20,36,78,35,21,14,63};
Arrays.sort(number);
for(int i=0;i<number.length;i++){
System.out.println(number[i]);
}
}
}
- 练习二
- <数组逆序>
public class day9_04 {
public static void main(String[] args) {
String[] sz={"A","B","C","D","E"};
for(int i=0;i<sz.length;i++){
System.out.println("逆序前:"+sz[i]);
}
for(int i=0;i<sz.length/2;i++){
String a=sz[i];
sz[i]=sz[(sz.length)-1-i];
sz[(sz.length)-1-i]=a;
}
for(int i=0;i<sz.length;i++){
System.out.println("逆序后:"+sz[i]);
}
}
}
public class day9_05 {
public static void main(String[] args) {
int[] sz={45,12,57,64};
int a=sz[0];
for(int i=1;i<sz.length;i++){
if(a<sz[i]){
a=sz[i];
}
}
System.out.println("最大的值是:"+a);
}
}
public class day9_07 {
public static void main(String[] args) {
String[] a=new String[5];
a[0]="hello";
a[1]="java";
a[2]="welcom";
String b="c#";
System.out.println("插入前:");
for(int i=0;i<a.length;i++){
System.out.println(a[i]);
}
for(int i=0;i<a.length;i++){
if(a[i]==null){
a[i]=b;
break;
}
}
System.out.println("插入后:");
for(int i=0;i<a.length;i++){
System.out.println(a[i]);
}
}
}
- 练习五
- <中部插入数据>
package day9;
public class day9_08 {
public static void main(String[] args) {
String[] a=new String[5];
a[0]="hello";
a[1]="java";
a[2]="welcom";
String b="html";
System.out.println("插入前:");
for(int q=0;q<a.length;q++){
System.out.println(a[q]);
}
for(int i=0;i<a.length;i++){
if(a[i]==null){
for(int j=1;j<=i;i--){
a[i]=a[i-j];
int sz=i-1;
if(sz==1){
a[sz]=b;
break;
}
}
break;
}
}
System.out.println("插入后:");
for(int q=0;q<a.length;q++){
System.out.println(a[q]);
}
}
}