第一次java上机

java作业

3

除法填表

17

找出数组中最大元素的下标值

public class Solution {
    private int findMinScript(int[] nums) {
        int max = 0;
        for (int i : nums) {
            if (i > max) {
                max = i;
            }
        }
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == max) {
                return i;
            }
        }
        return 0;
    }
    public static void main(String[] args) {
        int[] nums = new int[] { 1, 3, 5, 7, 89, 3, 5, 78, 76, 89 };
        Solution s = new Solution();
        System.out.println(s.findMinScript(nums));
    }
}

18

计算二维数组的每一行和，并输出和最大行的行号

public class Solution {
    private int findLargestSumRaw(int[][] nums) {
        int maxRaw = 0;
        int counter = 0;
        for (int i = 0; i < nums.length; i++) {
            int sum = 0;
            for (int j = 0; j < nums[i].length; j++) {
                sum += nums[i][j];
            }
            if (sum > maxRaw) {
                maxRaw = sum;
                counter = i;
            }
        }
        return counter;
    }
    public static void main(String[] args) {
        int[][] nums = new int[][] { { 5, 45, 78, 3 }, { 32, 4, 66, 23 }, { 2, 54, 31, 9 } };
        Solution s = new Solution();
        System.out.println(s.findLargestSumRaw(nums));
    }
}

19

吸血鬼数

某个翻译不出来的名字的理论

public class Solution {
    public static void main(String[] args) {
        Hello h = new Hello();
        int[] startDigit = new int[4];
        int[] productDigit = new int[4];
        for (int i = 10; i <= 99; i++) {
            for (int j = i; j <= 99; j++) {
                if ((i * j) % 9 != (i + j) % 9)
                    continue;
                int m = i * j;
                startDigit[0] = i / 10;
                startDigit[1] = i % 10;
                startDigit[2] = j / 10;
                startDigit[3] = j % 10;
                productDigit[0] = m / 1000;
                productDigit[1] = (m % 1000) / 100;
                productDigit[2] = m % 1000 % 100 / 10;
                productDigit[3] = m % 1000 % 100 % 10;
                int count = 0;
                for (int x = 0; x < 4; x++) {
                    for (int y = 0; y < 4; y++) {
                        if (productDigit[x] == startDigit[y]) {
                            count++;
                            productDigit[x] = -1;
                            startDigit[y] = -2;
                            if (count == 4) {
                                System.out.println(i + " * " + j + " : " + m);
                            }
                        }
                    }
                }
            }
        }
    }
}