10.25日报
一、数组的定义
int [ ] nums = new int [ 3 ] ;
nums [ 0 ] = 1
nums [ 1 ] = 2
nums [ 2 ] = 3
int [ ] nums = { 1 , 2 , 3 , 4 } ;
二、数组的性质
数组一旦建立不能改变长度。 每个位置只能存一个值,多了会覆盖。 编号从0开始,下标。 他有个长度的属性,最后一个位置的编号是长度-1 (length-1)。 数组里边可以是基本类型,也可以是引用类型。
三、数组的简单实用
1、长度查询
public class ArrayText {
public static void main ( String args[ ] ) {
int [ ] nums = new int [ 3 ] ;
nums[ 0 ] = 1 ;
nums[ 1 ] = 2 ;
nums[ 2 ] = 3 ;
int i = nums. length;
System. out. println ( i) ;
}
}
2、根据下标查询内容
public class ArrayText{
public static void main(String args[]){
int[] nums = {1,5,68,4,9,22};
System.out.println(nums[2]);
}
}
2、根据内容查询下标
public class ArrayText {
public static void main ( String args[ ] ) {
int [ ] nums = { 1 , 5 , 68 , 4 , 9 , 22 } ;
int target = - 1 ;
for ( int i = 0 ; i < nums. length; i++ ) {
if ( nums[ i] == 68 ) {
target = i;
break ;
}
}
System. out. println ( target) ;
}
}
3、遍历
public class ArrayText {
public static void main ( String args[ ] ) {
int [ ] nums = { 1 , 5 , 68 , 4 , 9 , 22 } ;
for ( int i = 0 ; i < nums. length; i++ ) {
System. out. println ( nums[ i] ) ;
}
}
}
4、求数组中最大
public class ArrayText {
public static void main ( String args[ ] ) {
int [ ] nums = { 1 , 5 , 68 , 4 , 9 , 22 } ;
int max = nums[ 0 ] ;
for ( int i = 1 ; i < nums. length; i++ ) {
if ( nums[ i] > max) {
max = nums[ i] ;
}
}
System. out. println ( max) ;
}
}
5、求数组中最小
public class ArrayText {
public static void main ( String args[ ] ) {
int [ ] nums = { 1 , 5 , 68 , 4 , 9 , 22 } ;
int min = nums[ 0 ] ;
for ( int i = 1 ; i < nums. length; i++ ) {
if ( nums[ i] < min) {
min = nums[ i] ;
}
}
System. out. println ( min) ;
}
}
6、数组中位置互换
public class ArrayText {
public static void main ( String args[ ] ) {
int [ ] nums = { 1 , 5 , 68 , 4 , 9 , 22 } ;
int temp = nums[ 3 ] ;
nums [ 3 ] = nums[ 0 ] ;
nums [ 0 ] = temp;
for ( int i = 0 ; i < nums. length; i++ ) {
System. out. println ( nums[ i] ) ;
}
}
}
7、冒泡排序
public class ArrayText {
public static void main ( String args[ ] ) {
int [ ] nums = { 1 , 5 , 68 , 4 , 9 , 22 } ;
for ( int j = 0 ; j < nums. length- 1 ; j++ )
for ( int i = 0 ; i < nums. length- 1 ; i++ ) {
if ( nums[ i] > nums[ i+ 1 ] ) {
int temp = nums[ i] ;
nums[ i] = nums[ i+ 1 ] ;
nums[ i+ 1 ] = temp;
}
}
}
for ( int i = 0 ; i < nums. length; i++ ) {
System. out. println ( nums[ i] ) ;
}
}
}
8、选择排序
public class ArrayText {
public static void main ( String args[ ] ) {
int [ ] nums = { 1 , 5 , 68 , 4 , 9 , 22 } ;
for ( int j = 0 ; j < nums. length- 1 ; j++ ) {
int min = j;
for ( int i = j+ 1 ; i < nums. length; i++ ) {
if ( nums[ i] < nums[ min] ) {
min = i;
}
}
int temp = nums[ j] ;
nums[ j] = nums[ min] ;
nums[ min] = temp;
}
for ( int i = 0 ; i< nums. length; i++ ) {
System. out. println ( nums[ i] ) ;
}
}
}
public class ArrayText {
public static void main ( String[ ] args) {
int [ ] nums = { 1 , 5 , 2 , 3 , 9 , 45 , 21 , 15 } ;
int min = nums[ 0 ] ;
for ( int i = 0 ; i < nums. length; i++ ) {
if ( nums[ i] < min) {
min = nums[ i] ;
}
}
for ( int i = 0 ; i < nums. length; i++ ) {
System. out. println ( nums[ i] ) ;
}
}
}