int double java_Java——int、double型数组常用操作工具类

1 public classArrayUtils {2 //求数组的最大值(int)

3 public static int getMax(int[] arr){4 int max = arr[0];5 for(int i = 0;i

13 public static int getMin(int[] arr){14 int min = arr[0];15 for(int i = 0;iarr[i]){17 min =arr[i];18 }19 }20 returnmin;21 }22 //得到数组最大值的下标(int)

23 public static int getMaxIndex(int[] arr){24 int maxIndex = 0;25 for(int i = 0;i

33 public static int getMinIndex(int[] arr){34 int minIndex = 0;35 for(int i = 0;i arr[i]){37 minIndex =i;38 }39 }40 returnminIndex;41 }42 //获得数组之和(int)

43 public static int getSum(int[] arr){44 int sum = 0;45 for(int i = 0; i < arr.length;i++){46 sum +=arr[i];47 }48 returnsum;49 }50 //获得平均值(int)

51 public static int getAverage(int[] arr){52 int avg = getSum(arr)/arr.length;53 returnavg;54 }55 //打印数组(int)

56 public static void printArray(int[] arr){57 for(int i = 0;i

66 public static void selectSortDescendingArray(int[] arr){67 for(int i = 0; i

68 for(int j = i+1;j

78 public static void selectSortAscendingArray(int[] arr){79 for(int i = 0; i

80 for(int j = i+1;jarr[j]){82 int temp =arr[j];83 arr[j] =arr[i];84 arr[i] =temp;85 }86 }87 }88 }89 //冒泡排序对数据进行降序排序(int)

90 public static void bubbleSortDescendingArray(int[] arr){91 for(int i = 0;i

102 public static void bubbleSortAscendingArray(int[] arr){103 for(int i = 0;iarr[j+1]){106 int temp = arr[j+1];107 arr[j+1] =arr[j];108 arr[j] =temp;109 }110 }111 }112 }113 //二分查找(int)

114 public static int binarySearch(int[] arr,intkey){115 intmin,mid,max;116 min = 0;117 max = arr.length-1;118 while(arr[min]arr[mid]){121 min = mid+1;122 }else if(key

132 //求数组的最大值(double)

133 public static double getMax(double[] arr){134 double max = arr[0];135 for(int i = 0;i

143 public static double getMin(double[] arr){144 double min = arr[0];145 for(int i = 0;iarr[i]){147 min =arr[i];148 }149 }150 returnmin;151 }152 //得到数组最大值的下标(double)

153 public static int getMaxIndex(double[] arr){154 int maxIndex = 0;155 for(int i = 0;i

163 public static int getMinIndex(double[] arr){164 int minIndex = 0;165 for(int i = 0;i arr[i]){167 minIndex =i;168 }169 }170 returnminIndex;171 }172 //获得数组之和(double)

173 public static double getSum(double[] arr){174 double sum = 0;175 for(int i = 0; i < arr.length;i++){176 sum +=arr[i];177 }178 returnsum;179 }180 //获得平均值(double)

181 public static double getAverage(double[] arr){182 double avg = getSum(arr)/arr.length;183 returnavg;184 }185 //打印数组(double)

186 public static void printArray(double[] arr){187 for(int i = 0;i

196 public static void selectSortDescendingArray(double[] arr){197 for(int i = 0; i

198 for(int j = i+1;j

208 public static void selectSortAscendingArray(double[] arr){209 for(int i = 0; i

210 for(int j = i+1;jarr[j]){212 double temp =arr[j];213 arr[j] =arr[i];214 arr[i] =temp;215 }216 }217 }218 }219 //冒泡排序对数据进行降序排序(double)

220 public static void bubbleSortDescendingArray(double[] arr){221 for(int i = 0;i

232 public static void bubbleSortAscendingArray(double[] arr){233 for(int i = 0;iarr[j+1]){236 double temp = arr[j+1];237 arr[j+1] =arr[j];238 arr[j] =temp;239 }240 }241 }242 }243 //二分查找(double)

244 public static int binarySearch(double[] arr,doublekey){245 intmin,mid,max;246 min = 0;247 max = arr.length-1;248 while(arr[min]arr[mid]){251 min = mid+1;252 }else if(key

261 }