1.求数组的平均值
public static void main(String[] args) {
int[] array={1,2,3,4,5,6};
System.out.println(avg(array));
}
public static double avg(int[] array){
int ret=0;
for (int i=0;i<array.length;i++){
ret=ret+array[i];
}
return (double)ret/(double)(array.length);
}
2.求数组所有元素之和
public static void main(String[] args) {
int[] array={1,2,3,4,5,6};
System.out.println(sum(array));
}
public static int sum(int[] array){
int ret=0;
for (int i=0;i<array.length;i++){
ret=ret+array[i];
}
return ret;
}
3.实现一个方法 transform, 以数组为参数, 循环将数组中的每个元素 乘以 2 , 并设置到对应的数组元素上. 例如 原数组为 {1, 2, 3}, 修改之后为 {2, 4, 6}
public static void main(String[] args) {
int[] array={1,2,3};
func1(array);
}
public static void func1(int[] array){
for (int i=0;i<array.length;i++){
array[i]=2*array[i];
System.out.print(array[i]);
}
}
4.创建数组并赋值
public static void main(String[] args) {
int[]array=new int[100];
func2(array);
}
public static void func2(int[] array){
for(int i=0;i<array.length;i++){
array[i]=i+1;
}
System.out.println(Arrays.toString(array));
}
5.实现冒泡排序(升序)
public static void BubbleSort(int[] array){
for(int i=0;i<array.length-1;i++){
boolean flg=false;
for(int j=0;j<array.length-1-i;j++){
if(array[j]>array[j+1]){
int tmp=array[j];
array[j]=array[j+1];
array[j+1]=tmp;
flg=true;
}
}
if(flg=false){ //某一趟排序结束后数组为升序,则结束
break;
}
}
}
6.给定一个整数有序数组,实现二分查找
public static void main(String[] args) {
int[] array={1,4,6,8,10};
System.out.println(myBinarySearch(array,11));
}
public static int myBinarySearch(int[] array,int n){
int left=0;
int right=array.length-1;
while(left<right){
int mid=(left+right)/2;
if(n>array[mid]){
left=mid+1;
}else if(n<array[mid]){
right=mid-1;
}else{
return mid;
}
}
return -1;
}