示例代码一:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
package
com;
public
class
ArrayDemo1 {
public
static
void
main(String[] args) {
int
[] arr =
new
int
[] {
12
,
34
,
54
,
23
};
// int[] arr = {12,34,54,23};
/* System.out.println(arr[0]);
System.out.println(arr[1]);
System.out.println(arr[2]);
System.out.println(arr[3]);*/
for
(
int
i =
0
; i < arr.length; i++) {
System.out.println(arr[i]);
}
System.out.println(
"---------------------"
);
boolean
[] bs =
new
boolean
[
4
];
System.out.println(bs[
0
]);
int
[] arrs =
new
int
[
4
];
for
(
int
i=
0
;i<arrs.length;i++){
System.out.println(arrs[i]);
}
}
}
|
示例代码二:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
|
package
com;
public
class
ArrayDemo2 {
public
static
void
main(String[] args) {
int
[] arr =
null
;
arr[
0
] =
12
;
arr[
1
] =
13
;
arr[
2
] =
14
;
arr[
3
] =
15
;
arr[
4
] =
16
;
arr[
5
] =
16
;
for
(
int
i=
0
;i<arr.length;i++){
System.out.println(
"number="
+arr[i]);
}
}
}
|
示例代码三:
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
28
29
30
31
32
33
34
35
36
37
|
package
com;
public
class
ArrayDemo3 {
public
static
void
main(String[] args) {
int
[][] arr =
new
int
[
3
][
2
];
arr[
0
][
0
] =
1
;
arr[
1
][
0
] =
2
;
arr[
2
][
0
] =
3
;
arr[
0
][
1
] =
2
;
arr[
1
][
1
] =
2
;
arr[
2
][
1
] =
2
;
//二维数组中有3个一维数组 每个数组都默认初始值null
int
[][] arr2 =
new
int
[
3
][];
arr2[
0
] =
new
int
[
3
];
arr2[
0
][
0
] =
1
;
arr2[
0
][
1
] =
2
;
arr2[
0
][
2
] =
3
;
arr2[
1
] =
new
int
[
3
];
arr2[
1
][
0
] =
4
;
arr2[
1
][
1
] =
5
;
arr2[
1
][
2
] =
6
;
arr2[
2
] =
new
int
[
3
];
arr2[
2
][
0
] =
4
;
arr2[
2
][
1
] =
5
;
arr2[
2
][
2
] =
6
;
int
[][] arr3 = {{
12
,
12
,
32
},{
322
,
435
,
65
,},{
12
,
324
,
345
}};
for
(
int
x=
0
;x<arr3.length;x++){
for
(
int
y =
0
;y<arr3[x].length;y++){
System.out.println(arr3[x][y]);
}
}
}
}
|
示例代码四:
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
package
com;
public
class
ArrayDemo4 {
/**
* 获取最大值
* @param arr
* @return
*/
public
static
int
getMax(
int
[] arr){
int
max = arr[
0
];
for
(
int
i=
0
;i<arr.length;i++){
if
(arr[i]>max){
max = arr[i];
}
}
return
max;
}
/**
* 最大值
* @param arr
* @return
*/
public
static
int
getMax2(
int
[] arr){
int
max =
0
;
for
(
int
i=
1
;i<arr.length;i++){
if
(arr[i]>arr[max]){
max = i;
}
}
return
arr[max];
}
/**
* 最小值
* @return
*/
public
static
int
getMin(
int
[] arr){
int
min =
0
;
for
(
int
i=
0
;i<arr.length;i++){
if
(arr[i]<arr[min]){
min = i;
}
}
return
arr[min];
}
public
static
void
main(String[] args) {
//获取数组的中最大值和最小值
int
[] arr = {
4
,
5
,
3
,
1
,
8
,
6
,
7
};
int
max = ArrayDemo4.getMax(arr);
System.out.println(
"最大值:"
+max);
int
min = ArrayDemo4.getMin(arr);
System.out.println(
"最小值:"
+min);
}
}
|
示例代码五:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
package
com;
public
class
ArrayDemo5 {
public
static
void
main(String[] args) {
//对给定的数据排序
int
[] arr = {
4
,
5
,
3
,
1
,
8
,
6
,
7
};
//选择排序
for
(
int
x =
0
;x<arr.length;x++){
for
(
int
y=x+
1
;y<arr.length;y++){
if
(arr[x]>arr[y]){
int
temp = arr[x];
arr[x] = arr[y];
arr[y] = temp;
}
}
}
System.out.println(
"排序过后:"
);
for
(
int
i=
0
;i<arr.length;i++){
System.out.println(arr[i]);
}
}
}
|
示例代码六:
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
28
29
30
|
package
com;
public
class
ArrayDemo6 {
public
static
void
main(String[] args) {
//对给定的数据排序
int
[] arr = {
4
,
5
,
3
,
1
,
8
,
6
,
7
};
// 5 4 3 1 8 6 7
// 5 4 3 1 8 6 7
// 5 4 3 8 1 6 7
// 5 4 3 8 6 1 7
// 5 4 3 8 6 7 1
// 5 4 8 6 7 3 1
//冒泡
for
(
int
x=
0
;x<arr.length;x++){
for
(
int
y =
0
;y<arr.length-x-
1
;y++){
//-x 让每一次比较的元素减少,-1 避免数组越界
if
(arr[y]<arr[y+
1
]){
int
temp = arr[y];
arr[y] = arr[y+
1
];
arr[y+
1
] = temp;
}
}
}
System.out.println(
"排序过后:"
);
for
(
int
i=
0
;i<arr.length;i++){
System.out.println(arr[i]);
}
}
}
|
版权声明:原创作品,如需转载,请注明出处。否则将追究法律责任
本文转自 l363130002 51CTO博客,原文链接:http://blog.51cto.com/liuyj/1655996