java循环链表实现拉丁方阵

/**
 * 功能 :
 * date : 2018/5/12
 *
 * @author : zcwang@wisdombud.com
 * @version : 0.0.4-snapshot
 * @since : JDK 1.8
 */
public class Latin {

    public static void main(String args[]) {
        int size=9;
        Node node= createLink(size);
        printLatin(node,size);
    }

    private static void printLatin(Node node,int size){
        Node head=node;
        for (int i = 1; i <=size; i++) {
            Node temp=head.next;
            for (int j=1;j<=size;j++){
                System.out.print(temp.getData());
                temp=temp.next;
            }
            System.out.println();
            head=head.next;
        }
    }
    private static Node createLink(int size){
        Node head=new Node();
        Node temp=head;
        for (int i=1;i<=size;i++){
            Node node=new Node(i);
            temp.setNext(node);
            temp=node;
        }
        temp.next=head.next;
        return head;
    }
    static class Node{

        private int data;
        private Node next;

        public Node(){}
        public Node(int data){
            this.data=data;
        }

        public int getData() {
            return data;
        }

        public void setData(final int data) {
            this.data = data;
        }

        public Node getNext() {
            return next;
        }

        public void setNext(final Node next) {
            this.next = next;
        }
    }
}