Advertisement
Guest User

countAdjacent

a guest
Nov 23rd, 2014
144
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.18 KB | None | 0 0
  1. public static int[][] countAdjacentMines(int grid[][], int row, int column){
  2.  
  3. try{
  4. for(int i = 0; i < grid.length; i++){
  5. for(int j = 0; j < grid.length; j++){
  6. if(grid[i][j] >= 9){
  7. if((i > 0 && i < 9) && (j > 0 && j < 9)){
  8. grid[i-1][j-1] += 1;
  9. grid[i-1][j] += 1;
  10. grid[i-1][j+1] += 1;
  11. grid[i][j-1] += 1;
  12. grid[i][j+1] += 1;
  13. grid[i+1][j-1] += 1;
  14. grid[i+1][j] += 1;
  15. grid[i+1][j+1] += 1;
  16. } // Adds one for each mine inside board.
  17.  
  18. if(i == 0 && j != 9 && j != 0){
  19. grid[i][j-1] += 1;
  20. grid[i][j+1] += 1;
  21. grid[i+1][j-1] += 1;
  22. grid[i+1][j] += 1;
  23. grid[i+1][j+1] += 1;
  24. } // Adds one for mines on top row.
  25.  
  26. if(j == 0 && i != 9 && i != 0){
  27. grid[i-1][j] += 1;
  28. grid[i-1][j+1] += 1;
  29. grid[i][j+1] += 1;
  30. grid[i+1][j] += 1;
  31. grid[i+1][j+1] += 1;
  32. } // Adds one for mines on left-most column.
  33.  
  34. if(i == 9 && j != 9 && j != 0){
  35. grid[i-1][j-1] += 1;
  36. grid[i-1][j] += 1;
  37. grid[i-1][j+1] += 1;
  38. grid[i][j-1] += 1;
  39. grid[i][j+1] += 1;
  40. } // Adds one for mines on bottom row.
  41.  
  42. if(j == 9 && i != 9 && i != 0){
  43. grid[i-1][j-1] += 1;
  44. grid[i-1][j] += 1;
  45. grid[i][j-1] += 1;
  46. grid[i+1][j-1] += 1;
  47. grid[i+1][j] += 1;
  48. } // Adds one for mines on right-most column.
  49.  
  50. if(i == 0 && j == 0){
  51. grid[i][j+1] += 1;
  52. grid[i+1][j+1] += 1;
  53. grid[i+1][j] += 1;
  54. } // Adds one for mines on top left corner.
  55.  
  56. if(i == 0 && j == 9){
  57. grid[i][j-1] += 1;
  58. grid[i+1][j] += 1;
  59. grid[i+1][j-1] += 1;
  60. } // Adds one for mines on top right corner.
  61.  
  62. if(i == 9 && j == 0){
  63. grid[i-1][j+1] += 1;
  64. grid[i-1][j] += 1;
  65. grid[i][j+1] += 1;
  66. } // Adds one for mines on bottom left corner.
  67.  
  68. if(i == 9 && j == 9){
  69. grid[i-1][j-1] += 1;
  70. grid[i-1][j] += 1;
  71. grid[i][j-1] += 1;
  72. } // Adds one for mines on bottom right corner.
  73. }
  74. }
  75. }
  76. }
  77.  
  78. catch(ArrayIndexOutOfBoundsException ex){
  79. System.out.println("\nbumbo");
  80. }
  81.  
  82. return grid;
  83. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement