数组的基本操作
求最大值
- 初始化一个一维数组并赋值
int[] arr=new int[10];
for (int i=0;i<arr.length;i++){
arr[i]= (int) (Math.random()*(99-10+1)+10);
System.out.println(arr[i]);
}
- 遍历数组,求最大值
int max=arr[0];
for (int i=0;i<arr.length;i++){
if(arr[i]>max){
max=arr[i];
}
}
System.out.println(max);
求最小值
int min=arr[0];
for (int i=0;i<arr.length;i++){
if(arr[i]<min){
min=arr[i];
}
}
System.out.println(min);
求和
int sum=0;
for(int i =0;i<arr.length;i++){
sum+=arr[i];
}
System.out.println(sum);
求平均值
int avg=sum/arr.length;
System.out.println(avg);
复制
@Test
public void test3(){
String[] arrStr=new String[]{"AA","bb","CC","Dd"};
String[] arrStr2=new String[arrStr.length];
for(int i=0;i<arrStr.length;i++){
arrStr2[i]=arrStr[i];
System.out.println(arrStr2[i]);
}
}
反转
@Test
public void test4(){
String[] arrStr=new String[]{"AA","bb","CC","Dd"};
for( int i=0;i<arrStr.length/2;i++){
String temp=arrStr[i];
arrStr[i]=arrStr[arrStr.length-i-1];
arrStr[arrStr.length-i-1]=temp;
}
for (String s:arrStr){
System.out.println(s);
}
}
算法
线性查找
@Test
public void test5(){
String[] arrStr=new String[]{"AA","bb","CC","Dd"};
String dest="TT";
boolean isFlag=true;
for(int i=0;i<arrStr.length;i++){
if(dest.equals(arrStr[i])){
System.out.println("找到了指定的元素位置: "+i);
isFlag=false;
break;
}
}
if(isFlag==true){
System.out.println("没有找到");
}
}
有序数组的二分查找
@Test
public void test6(){
int[] arrStr=new int[]{-562,-56,0,1,56,456,7854};
int dest=1;
int head=0;
int end=arrStr.length-1;
boolean isFlag=true;
while (head<=end){
int middle=(head+end)/2;
if(dest==arrStr[middle]){
System.out.println("找到了指定的元素位置: "+middle);
isFlag=false;
break;
}else if (dest>arrStr[middle]){
head=middle+1;
}else {
end=middle-1;
}
}
if(isFlag){
System.out.println("没有找到");
}
}
杨辉三角
@Test
public void test2(){
int[][] yangHui=new int[10][];
for(int i=0;i<yangHui.length;i++){
yangHui[i]=new int[i+1];
yangHui[i][0]=1;
yangHui[i][yangHui[i].length-1]=1;
if(i>1){
for(int j=1;j<yangHui[i].length-1;j++){
yangHui[i][j]=yangHui[i-1][j-1]+yangHui[i-1][j];
}
}
}
for(int i=0;i<yangHui.length;i++){
for (int j=0;j<yangHui[i].length;j++){
System.out.print(yangHui[i][j]+" ");
}
System.out.println();
}
}
冒泡排序
public class BubbleSortTest {
public static void main(String[] args) {
int[] arr=new int[]{12,-45,-56,-98,0,45,12,1,96};
for (int i=0;i<arr.length-1;i++){
for (int j=0;j<arr.length-i-1;j++){
if(arr[j]>arr[j+1]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
for(int i:arr){
System.out.println(i);
}
}
}
Arrays常用的工具类
判断两个数组是否相等
boolean isEquals= Arrays.equals(arr1,arr2);
System.out.println(isEquals);
将数组转换为String
System.out.println(Arrays.toString(arr1));
用新值填充数组
Arrays.fill(arr2,10);
数组排序
Arrays.sort(arr1);
查找元素所在的索引位置
int[] arr3=new int[]{-98,-66,-1,0,23,56,89,456};
int index = Arrays.binarySearch(arr3, 23);
System.out.println(index);
将数组转为List
List<int[]> list = Arrays.asList(new int[]{1, 2, 3, 4});
将一个数组复制到另外一个数组,并指定复制的长度,开始位置为索引0
int[] arr4 = Arrays.copyOf(arr1, 7);
将一个数组赋值到另外一个数组,指定开始索引位置和结束索引位置
int[] arr5 = Arrays.copyOfRange(arr1, 1, 3);