/* Author: Denise Roßberg Date: 30.01.2019 Program: Adjacent Clone Letters Date: 03.02.2019 Update: Bonus Suppose you have a 2D array of letters. A letter is adjacent to another if it is positioned either at the top, bottom, left, right, upper left, upper right, lower left or lower right of the other. Create a program that accepts the dimensions of a 2D array and fills that array with random letters. Then search through the array for adjacent similar letters. Indicate which letters have adjacent clones and enumerate them. Bonus: Replace clone letters to get the array without adjacent clone letters. Input two numbers for row and column of the Array. For example: Input = 3 4 --> 3*4 Matrix */ import java.util.Random; import java.util.HashMap; import java.util.HashSet; public class Matrix{ private String[][] matrix; private String[] letter = {"A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"}; //fill matrix with random letters public void fillMatrix(int x, int y){ matrix = new String[x][y]; Random rand = new Random(); for(int i = 0; i < x; i++){ for(int j = 0; j < y; j++){ //random number 0-25 int index = rand.nextInt(26); matrix[i][j] = letter[index]; } } } //the matrix without adjacent clone letters public void noClones(){ for(int i = 0; i < matrix.length; i++){ for(int j = 0; j < matrix[i].length; j++){ if(isAdjacent(i,j) == true){ matrix[i][j] = getLetter(i,j); } } } } //output public void printMatrix(){ for(int i = 0; i < matrix.length; i++){ for(int j = 0; j < matrix[i].length; j++){ System.out.print(matrix[i][j] + " "); } System.out.println(); } } //get new Letter public String getLetter(int x, int y){ String newLetter = ""; //add all adjacent letters to the hashSet HashSet neighbor = new HashSet(); //down if(x + 1 < matrix.length){ neighbor.add(matrix[x+1][y]); } //up if(x - 1 >= 0){ neighbor.add(matrix[x-1][y]); } //left if(y - 1 >= 0){ neighbor.add(matrix[x][y-1]); } //right if(y + 1 < matrix[x].length){ neighbor.add(matrix[x][y+1]); } //upper left if(x - 1 >= 0 && y - 1 >= 0){ neighbor.add(matrix[x-1][y-1]); } //upper right if(x - 1 >= 0 && y + 1 < matrix[x].length){ neighbor.add(matrix[x-1][y+1]); } //bottom left if(x + 1 < matrix.length && y - 1 >= 0){ neighbor.add(matrix[x+1][y-1]); } //bottom right if(x + 1 < matrix.length && y + 1 < matrix[x].length){ neighbor.add(matrix[x+1][y+1]); } //change the letter --> new letter != adjacent letter for(int i = 0; i < neighbor.size(); i++){ for(int j = 0; j < letter.length; j++){ if(neighbor.contains(letter[j]) == false){ newLetter = letter[j]; return newLetter; } } } return newLetter; } //check for adjacency public boolean isAdjacent(int x, int y){ //down if(x + 1 < matrix.length && matrix[x][y] == matrix[x+1][y]){ return true; } //up if(x - 1 >= 0 && matrix[x][y] == matrix[x-1][y]){ return true; } //left if(y - 1 >= 0 && matrix[x][y] == matrix[x][y-1]){ return true; } //right if(y + 1 < matrix[x].length && matrix[x][y] == matrix[x][y+1]){ return true; } //upper left if(x - 1 >= 0 && y - 1 >= 0 && matrix[x][y] == matrix[x-1][y-1]){ return true; } //upper right if(x - 1 >= 0 && y + 1 < matrix[x].length && matrix[x][y] == matrix[x-1][y+1]){ return true; } //bottom left if(x + 1 < matrix.length && y - 1 >= 0 && matrix[x][y] == matrix[x+1][y-1]){ return true; } //bottom right if(x + 1 < matrix.length && y + 1 < matrix[x].length && matrix[x][y] == matrix[x+1][y+1]){ return true; } return false; } //get adjacent clones public void getAdjacentClones(){ //put letter in a HashMap (key = letter; value = number of adjacent clones) HashMap hash = new HashMap(); for(int i = 0; i < matrix.length; i++){ for(int j = 0; j < matrix[i].length; j++){ hash.put(matrix[i][j], 0); } } //check adjacency for(int i = 0; i < matrix.length; i++){ for(int j = 0; j < matrix[i].length; j++){ int value = (int)hash.get(matrix[i][j]); if(isAdjacent(i,j) == true){ value++; } hash.put(matrix[i][j],value); } } //HashMap with keys and values System.out.println(hash.entrySet()); } } import java.util.Scanner; public class Program { public static void main(String[] args) { Scanner input = new Scanner(System.in); int x = 0; int y = 0; try{ x = input.nextInt(); y = input.nextInt(); }catch(Exception e){ System.out.println("Please input two numbers > 0."); return; } if(x <= 0 || y <= 0){ System.out.println("Please input two numbers > 0."); return; } Matrix clones = new Matrix(); clones.fillMatrix(x,y); clones.printMatrix(); System.out.println(); System.out.println("List of adjacent clones:"); clones.getAdjacentClones(); System.out.println(); System.out.println("Without adjacent clones:"); System.out.println(); clones.noClones(); clones.printMatrix(); System.out.println(); clones.getAdjacentClones(); } }

adjacent clone letters [challenge + bonus]