//  = { { }, { } }

String s[][] = new String[2][]; 

// 23

//  = {{"E1", "E2"}, {"E1", "E2", "E3"}}

s[0] = new String[2];

s[1] = new String[3];

public class BubbleSort {
/**
 * NN-1i(N-i)
 * @param args
 */
    public static void main(String[] args) {
        int arr[] = {26,15,29,66,99,88,36,77,111,1,6,8,8};
        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;
                }
            }
            System.out.print(""+(i+1)+"");
                                //
            for(int a=0;a<arr.length;a++) {
                System.out.print(arr[a] + "\t");
            }
            System.out.println("");
        }
        System.out.println("");
        for(int a = 0; a < arr.length;a++) {
            System.out.println(arr[a] + "\t");
        }
    }
}

java.util.Arrays

• fill
• sort,
• equals
• binarySearch

import java.util.Arrays;

public class TestArrays {
    public static void output(int[] array) {
        if (array != null) {
            for (int i = 0; i < array.length; i++) {
                System.out.print(array[i] + " ");
            }
        }
        System.out.println();
    }

    public static void main(String[] args) {
        int[] array = new int[5];
        // 
        Arrays.fill(array, 5);
        System.out.println("Arrays.fill(array, 5)");
        TestArrays.output(array);
        // 238
        Arrays.fill(array, 2, 4, 8);
        System.out.println("238Arrays.fill(array, 2, 4, 8)");
        TestArrays.output(array);
        int[] array1 = { 7, 8, 3, 2, 12, 6, 3, 5, 4 };
        // 26
        Arrays.sort(array1, 2, 7);
        System.out.println("26Arrays.sort(array,2,7)");
        TestArrays.output(array1);
        // 
        Arrays.sort(array1);
        System.out.println("Arrays.sort(array1)");
        TestArrays.output(array1);
        // 
        System.out.println(":Arrays.equals(array, array1):" + "\n" + Arrays.equals(array, array1));
        int[] array2 = array1.clone();
        System.out.println(":Arrays.equals(array1, array2):" + "\n" + Arrays.equals(array1, array2));
        // 
        Arrays.sort(array1);
        System.out.println("3array1Arrays.binarySearch(array1, 3)" + "\n" + Arrays.binarySearch(array1, 3));
        // 
        System.out.println("9array1Arrays.binarySearch(array1, 9)" + "\n" + Arrays.binarySearch(array1, 9));
    }
}

Arrays.fill(array, 5)
5 5 5 5 5 
238Arrays.fill(array, 2, 4, 8)
5 5 8 8 5 
26Arrays.sort(array,2,7)
7 8 2 3 3 6 12 5 4 
Arrays.sort(array1)
2 3 3 4 5 6 7 8 12 
:Arrays.equals(array, array1):
false
:Arrays.equals(array1, array2):
true
3array1Arrays.binarySearch(array1, 3)
1
9array1Arrays.binarySearch(array1, 9)
-9

5

EXIT

import java.util.Scanner;

//
public class Guessing {
    private static Scanner scan;
    // 
    public static void main(String[] args) {
        scan = new Scanner(System.in);
        char[] chs = generate();
        System.out.println(chs);
        int count = 0; // 
        while (true) { // 
            System.out.println("!");
            String str = scan.next().toUpperCase(); // 
            if (str.equals("EXIT")) { // 
                System.out.println("!");
                break;
            }
            char[] input = str.toCharArray(); // 
            int[] result = check(chs, input);
            if (result[0] == chs.length) { // 
                int score = 100 * chs.length - 10 * count;
                System.out.println("!:" + score);
                break;
            } else {
                count++;
                System.out.println(":" + result[1] + ":" + result[0]);
            }
        }
    }
    // chs
    public static char[] generate() {
        char[] chs = new char[5];
        char[] letters = { 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J',
                'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V',
                'W', 'X', 'Y', 'Z' };
        boolean[] flags = new boolean[letters.length];
        for (int i = 0; i < chs.length; i++) {
            int index;
            do {
                index = (int) (Math.random() * letters.length);
            } while (flags[index] == true);
            chs[i] = letters[index];
            flags[index] = true;
        }
        // i=0 index=0 chs[0]='A' flags[0]=true
        // i=1 index=25 chs[1]='Z' flags[25]=true
        // i=2 index=0/25/0/25/1 chs[2]='B' flags[1]=true
        return chs;
    }

    // :chsinput
    public static int[] check(char[] chs, char[] input) {
        int[] result = new int[2]; // (0,0)
        for (int i = 0; i < chs.length; i++) {
            for (int j = 0; j < input.length; j++) {
                if (chs[i] == input[j]) {
                    result[1]++;
                    if (i == j) {
                        result[0]++;
                    }
                    break;
                }
            }
        }
        return result;
    }
}

1-9 1-2,2-3 9

//
int[] num={2,4,9,1,6,7,9,12,63,4,87,54,67,65,4};
int totle;
for(int i=0;i<num.length;i++){
    for(int j=0;j<i;j++){
        if(num[j]>num[i]){
            totle=num[j];
            num[j]=num[i];
            num[i]=totle;
        }
    }
}

for(int i=num.length-1;0<=i;i--){
    for(int j=i;0<=j;j--){
        if(num[j]>num[i]){
            totle=num[j];
            num[j]=num[i];
            num[i]=totle;
        }
    }
}
for (int k : num) {
    System.out.print(k+"===");
}