可变长参数
public class MyTest{
public static int add(int... nums){
int sum = 0;
for(int num : nums){
sum += num;
}
return sum;
}
public static void main(String[] args){
int sum = add(1,10,100,101,-2);
System.out.println("sum =" + sum);
int[] arr = {100, 99,1};
sum = add(arr);
System.out.println("sum =" + sum);
}
}
数组的复制
import java.util.Arrays;
public class MyTest{
public static void main(String[] args){
int[] arr = {100, -1, 0, 1,2};
int[] arrNew = new int[arr.length];
for(int index = 0;index < arr.length;index++){
arrNew[index] = arr[index];
}
System.out.println("原数组:" + Arrays/toString(arr));
System.out.println("新数组:" + Arrays/toString(arrNew));
System.out.println("--------------------------------------");
int[] arrNew1 = Arrays.copyOf(arr,arr.length);
System.out.println("新数组:" + Arrays/toString(arrNew1));
System.out.println("--------------------------------------");
int[] arrNew2 = new int[arr.length];
System.arraycopy(arr,0,arrNew2.0,arr.length);
System.out.println("新数组:" + Arrays/toString(arrNew2));
}
}
数组的排序
int[] arr = {-1,100,7,9,6};
System.out.println("排序前:"+Arrays.toString(arr));
for(int index = 0;index < arr.length-1;index++){
for(int after = index+1;after < arr.length;after++){
if(arr[after] < arr[index]){
int temp = arr[after];
arr[after] = arr[index];
arr[index] = temp;
}
}
System.out.peintln("排序后" + Arrays.toString(arr));
}


二维数组

杨辉三角
