Java/More2D.java at main · CooperWang0912/Java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
package com.example.More2D;

public class More2D {

    public int[][] matrix(int n, int m){
        int a[][] = new int[n][m];
        int num = 0;
        for (int i = 0; i <= n - 1; i++){
            for (int j = 0; j <= m -1; j++){
                a[i][j] = num;
                num++;
            }
        }
        for (int i = 0; i <= n - 1; i++){
            for (int j = 0; j <= m -1; j++){
                System.out.print(a[i][j]);
            }
            System.out.println();
        }
        return a;
    }

    public double biggest(double n[][]){
        double max = n[0][0];
        for (int i = 0; i <= n.length-1; i++){
            for (int j = 0; j <= n[0].length-1; j++){
                if (n[i][j] > max){
                    max = n[i][j];
                }
            }
        }
        System.out.println(max);
        return max;
    }

    public int average(int n[][]){
        int sum = 0;
        for (int i = 0; i <= n.length-1; i++){
            for (int j = 0; j <= n[0].length-1; j++){
                sum += n[i][j];
            }
        }
        sum /= n.length * n[0].length;
        System.out.println(sum);
        return sum;
    }

    public int[] rowSum(int n[][]){
        int sum = 0;
        int pos = 0;
        int a[] = new int[n.length];
        for (int i = 0; i <= n.length-1; i++){
            sum = 0;
            for (int j = 0; j <= n[i].length-1; j++){
                sum += n[i][j];
            }
            a[pos] = sum;
            pos++;
        }
        for(int i = 0; i <= a.length-1; i++){
            System.out.print(a[i] + " ");
        }
        System.out.println();
        return a;
    }

    public boolean magic(int n[][]){
        boolean magicSqaure = true;
        if (n.length != n[0].length){
            magicSqaure = false;
        }
        else {
            int sum = 0;
            int pos = 0;
            int a[] = new int[n.length + 2];
            for (int i = 0; i <= n.length-1; i++){
                sum = 0;
                for (int j = 0; j <= n[i].length-1; j++){
                    sum += n[i][j];
                }
                a[pos] = sum;
                pos++;
            }
            sum = 0;
            for (int i = 0; i <= n.length-1; i++){
                sum += n[i][i];
            }
            a[pos] = sum;
            pos++;
            sum = 0;
            for (int i = 0; i <= n.length-1; i++){
                sum += n[i][n[0].length-1-i];
            }
            a[pos] = sum;
            for(int i = 0; i <= a.length-2; i++){
                for (int j = i + 1; j <= a.length-1; j++){
                    if (a[i] != a[j]){
                        magicSqaure = false;
                    }
                }
            }
        }
        System.out.println(magicSqaure);
        return magicSqaure;
    }

    public int nine(int n[][]){
        int sum = 0;
        int max = 0;
        int posX = 0;
        int posY = 0;
        for (int i = 0; i + 2 <= n.length-1; i++){
            for (int j = 0; j + 2 <= n[i].length-1; j++){
                if (j + 2 <= n[i].length-1 && j + 2 <= n[i+1].length-1 && j + 2 <= n[i+2].length-1) {
                    sum += n[i][j];
                    sum += n[i][j + 1];
                    sum += n[i][j + 2];
                    sum += n[i + 1][j];
                    sum += n[i + 1][j + 1];
                    sum += n[i + 1][j + 2];
                    sum += n[i + 2][j];
                    sum += n[i + 2][j + 1];
                    sum += n[i + 2][j + 2];
                }
                if (sum > max){
                    max = sum;
                    posY = i;
                    posX = j;
                }
            }
        }
        System.out.println(n[posY][posX]);
        return n[posY][posX];
    }

    public static void main(String[]args){
        More2D runner = new More2D();
        double a[][] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {12, 11, 11}};
        int b[][] = {{1, 2, 3}, {4, 5, 6}};
        int c[][] = {{2, 7, 6}, {9, 5, 1}, {4, 3, 8}};
        int d[][] = {{1, 2, }, {4, 5, 6}, {7, 8, 9}, {12, 11,11}};
        runner.matrix(5, 6);
        runner.biggest(a);
        runner.average(b);
        runner.rowSum(b);
        runner.magic(c);
        runner.nine(d);
    }
}