一.首先,数组的初始化问题:
(1)数组的动态初始化;
数组的动态初始化即数组的定义与分配空间和赋值操作分开进行;
基本类型数组
int arr[ ];
arr[ ] = new int[3];
arr[0] = 1, arr[1] = 2, arr[2] = 3;
引用类型数组
Date days[ ];
days = new Date[3];
days[0] = new Date(1,4,2001);
days[1] = new Date(2,3,2005);
days[2] = new Date(5,4,2011);
(2) 数组的静态初始化;
数组的静态初始化也即在数组定义的同时就为数组分配空间并赋值;
int arr[ ] = {1,2,3};//基本数据类型;
Date days[ ] = {new Date(1,4,2001),new Date(2,3,2004),new Date(5,11,2001)};//引用数据类型;
三.一些有点小意思的java数组小程序:
(1)日期排序程序;(核心算法为傻瓜冒泡~~~)
public class TestDateSort {
public static void main(String[] args) {
Date[] days = new Date[5];
days[0] = new Date(2006,5,4);
days[1] = new Date(2006,7,4);
days[2] = new Date(2008,5,4);
days[3] = new Date(2004,5,9);
days[4] = new Date(2004,5,4);
bubbleSort();
for(int i = 0; i < days.length;i++){
System.out.println(days[i]);
}
}
public static Date[] bubbleSort(Date[] a){
int len = a.length;
for(int i = len - 1; i >= 1; i--){
for(int j = 0; j <= i - 1; j++){
if(a[j].compare(a[j+1]) > 0) {
Date temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
}
}
return a;
}
}
class Date {
int year,month,day;
Date(int y, int m, int d){
year = y; month = m; day = d;
}
public int compare(Date date){
return year > date.year ? 1 :year < date.year?-1 :month > date.month?1:month < date.month?-1
:day > date.day?1:day < date.day?-1:0;
}
public String toString(){//重写了object基类的toString方法
return "Year:Month:Day--"+year+"-"+month+"-"+day;
}
}
(2)数三退一游戏,还挺有意思的呢~
题目大意为:500个小朋友围成一个圈,从第一个小朋友开始报数,1,2,3,1,2,3,1,2,3,,,,,以此类推,数到三的小朋友退出,直到剩下最后一个小朋友,问这个小朋友的编号;
public static void main(String[] args) {
boolean arr = new boolean[500];
for(int i = 0; i < arr.length; i++) {
arr[i] = true;
}
int countLeft = arr.length;
int countNum = 0;
int index = 0;
while(countLeft > 1) {
if(arr[index]) {
countNum++;
if(countNum == 3) {
countNum = 0;
arr[index] = false;
countLeft--;
}
}
index++;
if(index == arr.length) {
index = 0;
}
}
for(int i = 0; i < arr.length; i++) {
if(arr[i]) {
System.out.println(i);
}
}
}
}