数组判断大小

string类型排序

package dasd;

public class bijao {

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
public static void main(String[] args) {
// TODO Auto-generated method stub

String[] a = {"10", "55", "45"};
if (a == null a.length == 0){
return;
}
String min = a[0];
String max = a[0];
int len = a.length;

for(int i=0; i<a.length; i++){
if (len < min.length()){
min = a[i];
System.out.println("最值小是"+min);
}else if(len > max.length()){
max = a[i];
System.out.println("最值大"+max);
}





}

}

}

int类型排序

package dasd;

public class intlleix {

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr[]= {4,5,56,8,9,6,2,};
int max=0;
int min=100;
for(int i=0;i<=arr.length-1;i++) {
if(arr[i]>max) {
max=arr[i];
}
if(arr[i]<min) {
min=arr[i];
}
System.out.println(max+" "+min);
}
}

}

倒序练习

package dasd;

public class paixni {

1
2
3
4
5
public static void main(String[] args) {
// TODO Auto-generated method stub

int arr[]= {2,34,5,6,7};
int a= arr.length/2;

// System.out.println(a);
for (int i=0;i<a;i++) {
int x=arr[i];
arr[i]=arr[arr.length-1-i];
arr[arr.length-1-i]=x;

1
2
3
4
5
    }
for(int y=0;y<arr.length;y++) {
System.out.println(arr[y]);
}
}

}


数组判断大小
http://example.com/数组判断大小.html
作者
John Doe
发布于
2021年3月26日
许可协议