2차원 배열 동적 할당과, 해제

할당 (i by j)

char **mine;
mine = new char *[i];
for(int z=0; z<=j; z++)
 mine[z] = new char[j];

int **sweaper;
sweaper = new int *[i];
for(int x=0; x<=j; x++)
 sweaper[x] = new int[j];

해제

for(int q=0; q<i; q++)
 delete mine[q];
delete mine;

for(int w=0; w<i; w++)
 delete sweaper[w];
delete sweaper;