Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- import static java.lang.System.*;
- public class FancyWordThree
- {
- private char[][]mat;
- public FancyWordThree()
- {
- }
- public FancyWordThree(String s)
- {
- //Initializing matrix
- mat = new char[4*s.length() - 3][4*s.length() - 3];
- //Filling matrix with empty spaces
- for(int i=0; i<mat.length; i++){
- for(int j=0; j<mat[i].length; j++){
- mat[i][j] = ' ';
- }
- }
- //Node: any cell in the matrix containing the first letter of the string
- //Expading each node in three directions
- int a = s.length()-1;
- for(int k=0; k<s.length(); k++){
- //Node 1
- mat[a-k][a+k] = s.charAt(k);
- mat[a+k][a+k] = s.charAt(k);
- mat[a+k][a-k] = s.charAt(k);
- //Node 2
- mat[a+k][mat.length-1-a+k] = s.charAt(k);
- mat[a+k][mat.length-1-a-k] = s.charAt(k);
- mat[a-k][mat.length-1-a-k] = s.charAt(k);
- //Node 3
- mat[mat.length-1-a-k][a+k] = s.charAt(k);
- mat[mat.length-1-a-k][a-k] = s.charAt(k);
- mat[mat.length-1-a+k][a+k] = s.charAt(k);
- //Node 4
- mat[mat.length-1-a-k][mat.length-1-a+k] = s.charAt(k);
- mat[mat.length-1-a-k][mat.length-1-a-k] = s.charAt(k);
- mat[mat.length-1-a+k][mat.length-1-a-k] = s.charAt(k);
- }
- }
- public String toString()
- {
- String output="";
- for(int i=0; i<mat.length; i++){
- for(int j=0; j<mat[i].length; j++){
- System.out.print(mat[i][j]);
- }
- System.out.println();
- }
- return output+"\n\n";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement