Can you change this C++ to Java please (please dont give answer after using converter, thank youu)

#include #include #include #include #include #include

using namespace std;

const char UP = 0x1; const char DOWN = 0x2; const char LEFT = 0x4; const char RIGHT = 0x8; const char VISITED = 0x10;

void set_flag(char &cell, const char flag) { cell |= flag; }

bool has_flag(const char &cell, const char flag) { return static_cast(cell & flag); }

int rand_int(int a, int b) { double N = (double) abs(a - b); int x = a + (int) (N * rand()/(RAND_MAX + 1.0)); return x; }

void dump_maze(const char (&maze)[12][12]) { cout

void generate_maze(char (&maze)[12][12], pair current) {

static stack stk; int i = current.first; int j = current.second; set_flag(maze[i][j], VISITED); vector unvisited_neighbours; vector flags; if((i > 0) && !has_flag(maze[i-1][j], VISITED)) { unvisited_neighbours.push_back(make_pair(i-1, j)); flags.push_back(UP); } if((i 0) && !has_flag(maze[i][j-1], VISITED)) { unvisited_neighbours.push_back(make_pair(i, j-1)); flags.push_back(LEFT); } if((j 0) { int tmp = rand_int(0, len); int k = unvisited_neighbours[tmp].first; int l = unvisited_neighbours[tmp].second; char t1 = flags[tmp]; char t2 = (t1 == UP) ? DOWN : (t1 == LEFT) ? RIGHT : (t1 == DOWN) ? UP : LEFT; set_flag(maze[i][j], t1); set_flag(maze[k][l], t2); stk.push(current); generate_maze(maze, unvisited_neighbours[tmp]); }else if(stk.size() == 0) { return; }else{ pair tmp = stk.top(); stk.pop(); generate_maze(maze, tmp); } }

int main(int argc, char *argv[]) { srand(time(NULL)); char maze[12][12] = {0}; generate_maze(maze, make_pair(0,0)); set_flag(maze[0][0], LEFT); set_flag(maze[11][11], DOWN); dump_maze(maze); return 0; }

Output :

-| I_I_ _ __ | |_ _|_ | | | |-- |_ __ |_| |_ |_ _| | -_- . - -- | |- |