数组的复制1
1.缺点
修改源数组,新数组的数据也随之改变
public static void main(String[] args){
//源数组
String[] names = {"樱井步","深田咏美","濑亚美莉","吉泽明步"};
//新数组
String[] newNames = names;
//修改源数组
names[0] = "林成";
//遍历新数组
for(String name : newNames){
System.out.println(name);
}
}
}
四、数组的复制2
public static void main(String[] args){
//源数组
String[] names = {"樱井步","深田咏美","濑亚美莉","吉泽明步"};
//新数组
String[] newNames = new String[names.length];
//将源数组中数据依次赋值给新数组
for(int i = 0;i<names.length;i++){
newNames[i] = names[i];
}
//修改源数组
names[0] = "林成";
//遍历新数组
for(String name : newNames){
System.out.println(name);
}
}
}
数组的扩容
public static void main(String[] args){
//源数组
String[] names = {"樱井步","深田咏美","濑亚美莉","吉泽明步"};
//新数组
int capacity = names.length + (names.length>>1);//新容量:是源数组长度的1.5倍
String[] newNames = new String[capacity];
//把源数组所有的数据迁移到新数组中
for(int i = 0;i<names.length;i++){
newNames[i] = names[i];
}
//将新数组的地址赋值给源数组
names = newNames;
//遍历源数组
for(String name:names){
System.out.println(name);
}
}
}
数组的删除1
1.缺点
数组原本是存放数据的,删除元素后,数组长度变短
public static void main(String[] args){
//源数组
String[] names = {"樱井步","深田咏美","濑亚美莉","吉泽明步"};
//新数组
String[] newNames = new String[names.length-1];
//将源数组的数据迁移到新数组中,要删除的元素(深田咏美)除外
int index = 0;//新数组的下标
for(String name:names){
if(!name.equals("深田咏美")){
newNames[index] = name;
index++;
}
}
//将新数组的地址赋值给源数组
names = newNames;
//遍历源数组
for(String name:names){
System.out.println(name);
}
}
}
数组的删除2
public static void main(String[] args){
//源数组
String[] names = {"樱井步","深田咏美","濑亚美莉","吉泽明步"};
//数据的迁移
for(int i = 1;i<names.length-1;i++){
names[i] = names[i+1];
}
names[names.length-1] = null;
//遍历源数组
for(String name:names){
System.out.println(name);
}
}
}
数组的参数和返回值
1.需求
设计一个方法,传入数组,返回最大值和最小值
public static void main(String[] args){
int[] is = {1,2,3,4,5,6};
int[] newArr = method(is);
System.out.println("最大值为:" + newArr[0]);
System.out.println("最小值为:" + newArr[1]);
}
public static int[] method(int[] is){
int max = is[0];
int min = is[0];
for(int i = 1;i<is.length;i++){
if(max < is[i]){
max = is[i];
}
if(min > is[i]){
min = is[i];
}
}
return new int[]{max,min};
}
}