2道Java考试题

1、二维数组

package treeSet.demo;


import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/*
 * 输入:bricks={{0, 5},{8, 10},{5, 8}}
 * 输入：length =10;
 * 输出：{0,2,1}
 * */
public class treeset02 {
    public static void main(String[] args) {
        int[][] bricks = {
                {0, 5},
                {8, 10},
                {5, 8}
        };
        int length = 10;
        int[] ints = paveRoad(length, bricks);
        System.out.println(Arrays.toString(ints));

    }

    public static int[] paveRoad(int length, int[][] bricks) {
        int[] resArray = new int[10];
        int minValue = 0;
        boolean flag = false;
        List<Integer> list = new ArrayList<>();
        // 找到[0,*]的下标
        for (int i = 0; i < bricks.length; i++) { // i = 0 1 2
            for (int j = i; j < bricks.length; j++) {
                if (bricks[j][0] == minValue && bricks[j][1] <= length) {
                    resArray[i] = j;
                    minValue = bricks[j][1];

                    int temp = bricks[i][0];
                    bricks[i][0] = bricks[j][0];
                    bricks[j][0] = temp;


                    temp = bricks[i][1];
                    bricks[i][1] = bricks[j][1];
                    bricks[j][1] = temp;
                    System.out.println(j);
                } else {
                    flag = false;
                }
            }
        }
        flag = true;
        //System.out.println(list);
        return new int[]{0};
    }

}

2、字符串

package treeSet.demo;

// 字母转换
public class treeset01 {
    public static void main(String[] args) {
        String str = "abZ b, z";
        int step = 1;
        StringBuilder stringBuilder = new StringBuilder();
        // 完成移位
        for (int i = 0; i < str.length(); i++) {
            char c = str.charAt(i);
            if (c >= 'a' && c <= 'z') {
                int cc = (char) ((c - 'a' + step) % 26);
                stringBuilder.append((char) ('a' + cc));
            } else if (c >= 'A' && c <= 'Z') {
                int cc = (char) ((c - 'A' + step) % 26);
                stringBuilder.append((char) ('A' + cc));
            } else {
                stringBuilder.append(str.charAt(i));
            }
        }
        String string = stringBuilder.toString();
        System.out.println(string);
        // 完成元音字母转换
        StringBuilder stringBuilder1 = new StringBuilder();
        for (int i = 0; i < string.length(); i++) {
            if (isBigYuan(string.charAt(i))) {
                stringBuilder1.append(Character.toLowerCase(string.charAt(i)));
            } else if (isSmallYuan(string.charAt(i))) {
                stringBuilder1.append(Character.toUpperCase(string.charAt(i)));
            } else {
                stringBuilder1.append(string.charAt(i));
            }
        }
        System.out.println(stringBuilder1);
    }

    public static boolean isBigYuan(char c) {
        return c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U';
    }

    public static boolean isSmallYuan(char c) {
        return c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u';
    }
}