9-咸鱼学Java-一些例题

1.如何排序数组并搜索某个元素，返回下标？

package homework;

public class one {

        public static int maopaoSelect(int[] a,int x)
        {   
            int temp;
            for (int i = 0; i < a.length; i++) {
                for (int j = 0; j < a.length-1-i; j++) {

                    if(a[j]>a[j+1])
                    {
                        temp = a[j];
                        a[j] = a[j+1];
                        a[j+1] = temp;
                    }
                }
            }
            for (int i = 0; i < a.length; i++) {
                if(a[i]==x)
                {
                    return i;
                }
            }
            return -1;
        }
        public static void show(int[] Array)
        {
            for (int i = 0; i < Array.length; i++) {
                System.out.print(Array[i]+"  ");
            }
            System.out.println();
        }
    public static void main(String[] args) {
        int[] a = {12,34,3,43,5,65,7,92,21,4};
        System.out.println("原数组");
        show(a);
        int maopaoSelect = maopaoSelect(a, 4);
        System.out.println("排序后");
        show(a);
        System.out.println("要查找的下标为："+maopaoSelect);
    }



}

结果
原数组
12 34 3 43 5 65 7 92 21 4
排序后
3 4 5 7 12 21 34 43 65 92
要查找的下标为：1

2.如何排序数组并插入某个元素

package homework;

public class two {
    public static void maopaoInsert(int[] a)
    {   
        int temp;
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a.length-1-i; j++) {

                if(a[j]>a[j+1])
                {
                    temp = a[j];
                    a[j] = a[j+1];
                    a[j+1] = temp;
                }
            }
        }
    }
    public static void show(int[] Array)
    {
        for (int i = 0; i < Array.length; i++) {
            System.out.print(Array[i]+"  ");
        }
        System.out.println();
    }
public static void main(String[] args) {
    int[] a = {12,34,3,43,5,65,7,92,21,4};
    int x = 18;  //插入的数
    int[] b = new int[a.length+1];
    b[0]  = x;   //先放入数
    System.out.println("原数组");
    show(a);
    for (int i = 0; i < a.length; i++) { //拷贝
        b[i+1] = a[i];
    }
    maopaoInsert(b);    //排序
    System.out.println("插入排序后");
    show(b);
}
}

结果
原数组
12 34 3 43 5 65 7 92 21 4
插入排序后
3 4 5 7 12 18 21 34 43 65 92
3.如何确定二维数组上限

package homework;

public class Three {
    public static int twolength(int[][] a)
    {
        int count = 0;
        for (int i = 0; i < a.length; i++) {
                count+=a[i].length;
        }
        return count;
    }
public static void main(String[] args) {
    int[][] a = new int[10][10];
    System.out.println(twolength(a));
}
}

结果100
4.如何翻转数组

package homework;

import java.util.Arrays;

public class four {

public static void main(String[] args) {
    int[] a = {12,34,3,43,5,65,7,92,21,4};
    int[] b = new int[a.length];
    for (int i = 0; i < a.length; i++) {
        b[a.length-i-1] = a[i];
    }
    a = b;
    System.out.println(Arrays.toString(a));
}
}

结果[4, 21, 92, 7, 65, 5, 43, 3, 34, 12]
5.如何将字符串数组写入输出控制台

package homework;

public class five {
public static void main(String[] args) {
    String[] T = {"One","Two","Three","Four"};
    for (int i = 0; i < T.length; i++) {
        System.out.print(T[i]+"  ");
    }
    System.out.println();
    System.out.println("==============");
    for (String string : T) {
        System.out.print(string+"  ");
    }
}
}

结果
One Two Three Four
==============
One Two Three Four
6.如何搜索数组中最小值，最大值

package homework;

public class six {
public static void main(String[] args) {
    int[] a = {12,34,3,43,5,65,7,92,21,4};
    int max=a[0],min=a[0];
    for (int i = 0; i < a.length; i++) {
        if(a[i]>max)
        {
            max = a[i];
        }
        if(a[i]<min)
        {
            min = a[i];
        }
    }
    System.out.println("max:"+max+"  min:"+min);
}
}

结果
max:92 min:3
7.如何合并两个数组

package homework;

import java.util.Arrays;

public class seven {
public static void main(String[] args) {
    int[] a = {12,34,3,43,5};
    int[] b = {65,7,92,21,4};
    int[] c = new int[a.length+b.length];
    for (int i = 0; i < a.length; i++) {
        c[i] = a[i];
    }
    for (int i = 0; i <b.length; i++) {
        c[i+a.length] = b[i];
    }
    System.out.println(Arrays.toString(c));
}
}

结果[12, 34, 3, 43, 5, 65, 7, 92, 21, 4]
8.如何填充数组

package homework;

import java.util.Arrays;

public class eight {
public static void main(String[] args) {
    int[] a = new int[10];
    Arrays.fill(a, 2);//填充
    System.out.println(Arrays.toString(a));
}
}

结果[2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
9.初始化后如何扩展数组？

package homework;

import java.util.Arrays;

public class nine {
public static void main(String[] args) {
    String[] a = {"A","B","C","D"};
    String[] b = new String[2+a.length];
    for (int i = 0; i < a.length; i++) {
        b[i] = a[i];
    }
    b[4] = "E";
    b[5] = "F";
    System.out.println(Arrays.toString(b));
}
}

结果[A, B, C, D, E, F]
10.如何排序比较数组

package homework;

import java.util.Arrays;

public class ten {
public static void main(String[] args) {
    int[] a = {12,34,3,43,5};
    int[] b = {65,7,92,21,4};
    Arrays.sort(a);
    Arrays.sort(b);
    int x=0;
    for (int i = 0; i < a.length; i++) {
        if(a[i]!=b[i])
        {
            x = a[i] - b[i];
            break;
        }
    }
    if(x==0)
        System.out.println("a=b");
    if(x>0)
        System.out.println("a>b");
    if(x<0)
        System.out.println("a<b");
}
}

结果a<b
11.如何删除数组指定元素

package homework;

import java.util.Arrays;

public class eleven {
public static void main(String[] args) {
    int[] a = {12,34,3,43,5,65,7,92,21,4};
    int x = 3;  //要删除的数
    Arrays.sort(a);//排序
    int i = Arrays.binarySearch(a,x);//查询下标
    for (int j = i; j < a.length-1; j++) {
        a[j] = a[j+1];
    }
    a[a.length-1] = 0;
    System.out.println(Arrays.toString(a));
}
}

结果[4, 5, 7, 12, 21, 34, 43, 65, 92, 0]
12.如何从输出查找元素

package homework;

public class twelve {
public static void main(String[] args) {
    int[] a = {12,34,3,43,5,65,7,92,21,4};
    int x = 43;
    int t = serach(x, a);
    System.out.println("查到的下标为:"+t);
}
public static int serach(int x,int[] a)
{
    for (int i = 0; i < a.length; i++) {
        if(a[i]==x)
        return i;
    }
    return -1;
}
}

结果查到的下标为:3

PS：每个题可能都不是最优解，所以请各位大佬能帮我改进。