SpericalCubePrint

package com.image.main;

import java.util.LinkedList;

public class SpericalCubePrint{

    public static void main(String[] args) {
        int i_length =3;
                int j_length =6;

                int[][] array = new int[i_length][j_length];
                int count = 11;
                for (int i = 0; i < i_length; i++) {
                        for (int j = 0; j < j_length; j++) {
                                array[i][j] = count;
                                count++;
                        }
                }

                for (int i = 0; i < i_length; i++) {
                        for (int j = 0; j < j_length; j++) {
                                System.out.print(array[i][j] + " ");
                        }
                        System.out.println();
                }

                int counter = 0;
                int i = 0, j = 0;
                int n = 0;
                int c = 1;
                int d = 1;

                LinkedList<String> ar= new LinkedList<String>();
                while (counter < (i_length) * (j_length)) {
                        switch (n % 4) {
                        case 0:
                           //     System.out.print("1:Array["+i+"]["+j+"]>>");
                            System.out.print(array[i][j]+" ");
                                   ar.add(i+""+j);
                                if (j >= (j_length - 2)) {
                                        n++;
                                }
                                j++;
                                break;
                        case 1:
                            //    System.out.print("2:Array["+i+"]["+j+"]>>");
                             System.out.print(array[i][j]+" ");
                                   ar.add(i+""+j);
                                if (i >= (i_length - 2)) {
                                        n++;
                                }
                                i++;
                                break;
                        case 2:
                           //     System.out.print("3:Array["+i+"]["+j+"]>>");
                                System.out.print(array[i][j]+" ");
                                ar.add(i+""+j);
                                if (j <= c) {
                                        n++;
                                        c++;
                                }
                                j--;
                                break;
                        case 3:
                        //        System.out.print("4:Array["+i+"]["+j+"]>>");
                                System.out.print(array[i][j]+" ");
                                ar.add(i+""+j);
                                if (i <= d) {
                                        n++;
                                        d++;
                                }
                                i--;
                                break;
                        }
                       String ij = ar.getLast();
                        if(ij!=null){
                                int i_last = Integer.parseInt(ij.substring(0, 1));
                                int j_last = Integer.parseInt(ij.substring(1, 2));
                                if(ar.contains(i+""+j)){
                                        ar.add(i+""+j);
                                        if(j_last==j && i<i_last){
                                             i++;
                                             j++;
                                        } else if(i_last==i && j_last<j){
                                             i++;
                                             j--;
                                        } else if(j_last==j && i>i_last){
                                             i--;
                                             j--;
                                        } else if(i_last==i && j_last>j){
                                             i--;
                                             j++;
                                        }
                                }
                        }
                        counter++;
                }
                System.out.println();
                System.out.println("Done");
    }
}