I'm creating a minesweeper game in Java, this piece of code counts the number of mines adjacent to a square. How do I count the mines adjacent to a square that are in the border of the grid without having an out of array error? If you can answer whith the little piece of code I gave you.

ce Debug Minesweeper/srchMyPanel Java Eclipse Source Refactor Navigate Search Project Run Window Help "MyPanel java ouse Adapter Java for (int x 1; x TOTAL COLUNNS for (int y 1 y TOTAL RONS; y++) int numCount 0; if (bombAri -11 numCount++; if(bomb Array[x][y-11- 1) numCount++ numCount if(bombArray[x][y+1] -1)( num Count++; if(bombArray[x+1] numCount++; if (bombArray[x+1][y+1] -1){ num Count +i nun Count++; nur Count++i adjacent Bombs[x][y) s nuecounti tava Applicationl caprogram Files Javaudk180 121 bin avaw exe (Mar 27 2017.5 17 4 PM