Wave_algorithm/methods.java at main · PromathBul/Wave_algorithm · 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
import java.util.Random;

public class methods {
    public static final String RED = "\033[0;31m";
    public static final String RESET = "\u001B[0m";

    static int[][] createField(int rows, int columns) {
        int[][] field = new int[rows + 2][columns + 2];

        for (int i = 0; i < field.length; i++) {
            for (int j = 0; j < field[i].length; j++) {
                if (i == 0 || i == rows + 1 || j == 0 || j == columns + 1)
                    field[i][j] = -1;
            }
        }
        return field;
    }

    static void buildingWalls(int[][] array, int walls) {
        Random rnd = new Random();
        for (int i = 0; i < walls; i++) {
            int row = rnd.nextInt(1, array.length - 1);
            int column = rnd.nextInt(1, array[0].length - 1);
            while (array[row][column] == -1 || (row == array.length - 2 && column == 1)
                    || (row == 1 && column == array[0].length - 2)) {
                row = rnd.nextInt(1, array.length - 1);
                column = rnd.nextInt(1, array[0].length - 1);
            }
            array[row][column] = -1;
        }
    }

    static int drawRoutes(int[][] array) {
        int step = 1;
        for (; step < array.length * array[0].length - 2 * (array.length + array[0].length - 2); step++) {
            for (int i = 1; i < array.length - 1; i++) {
                for (int j = 1; j < array[i].length - 1; j++) {
                    if (array[i][j] == step) {
                        if (array[i + 1][j] == -2 || array[i - 1][j] == -2 || array[i][j + 1] == -2
                                || array[i][j - 1] == -2)
                            return step;
                        else {
                            if (array[i - 1][j] == 0)
                                array[i - 1][j] = step + 1;
                            if (array[i + 1][j] == 0)
                                array[i + 1][j] = step + 1;
                            if (array[i][j + 1] == 0)
                                array[i][j + 1] = step + 1;
                            if (array[i][j - 1] == 0)
                                array[i][j - 1] = step + 1;
                        }
                    }
                }
            }
        }
        return step;
    }

    static int[][] writingRoute(int[][] array, int[] finish, int step) {
        int[][] route = new int[step][2];
        for (int i = 0, value = step; i < step; i++, value--) {
            if (array[finish[0]][finish[1] - 1] == value)
                finish[1]--;
            else if (array[finish[0]][finish[1] + 1] == value)
                finish[1]++;
            else if (array[finish[0] + 1][finish[1]] == value)
                finish[0]++;
            else
                finish[0]--;
            route[i][0] = finish[0];
            route[i][1] = finish[1];
        }
        return route;
    }

    static void ReverseArray(int[][] array) {
        for (int i = 0; i < array.length / 2; i++) {
            int helperFirst = array[i][0];
            int helperSecond = array[i][1];
            array[i][0] = array[array.length - 1 - i][0];
            array[i][1] = array[array.length - 1 - i][1];
            array[array.length - 1 - i][0] = helperFirst;
            array[array.length - 1 - i][1] = helperSecond;

        }
    }

    static void show2dArrayWith2Col(int[][] array) {
        for (int i = 0; i < array.length; i++)
            System.out.printf("(%d, %d) ", array[i][0], array[i][1]);

    }

    static void elementsColoring(int[][] array, int[][] coordinates) {
        for (int i = 0; i < array[0].length * 8; i++) {
            System.out.print("_");
        }
        System.out.println();
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                if (j != array[i].length - 1) {
                    Boolean check = false;
                    for (int k = 0; k < coordinates.length; k++) {
                        if (i == coordinates[k][0] && j == coordinates[k][1]) {
                            System.out.printf("%s| %d%s\t", RED, array[i][j], RESET);
                            check = true;
                        }
                    }
                    if (check == false)
                        System.out.printf("| %d\t", array[i][j]);
                    else
                        check = false;
                } else
                    System.out.printf("| %d\t|", array[i][j]);
            }
            System.out.println();
            for (int k = 0; k < array[0].length * 8 + 1; k++) {
                if (k % 8 == 0)
                    System.out.print("|");
                else
                    System.out.print("_");
            }
            System.out.println();
        }
    }

}