java循环链表实现魔术师发牌问题

package com.wisdombud.zyzx.report.start;

import static java.lang.System.out;

/**
 * 功能 :
 * date : 2018/5/10
 *
 * @author : zcwang
 * @version : 0.0.4-snapshot
 * @since : JDK 1.8
 */
public class LinkLoop {
    
    public static void main(String args[]) {
        int size=13;
        Node linedList=createLikedList(size);
        Node pai=buildSeq(linedList);
        for (int i=0;i<size;i++){
            System.out.println(pai.getData());
            pai=pai.getNext();
        }
    }

    private static Node createLikedList(int size){
        Node head=null;
        Node temp=head;
        for (int i=1;i<=size;i++){
            Node newNode=new Node(0);
            if (null==head){
                head=newNode;
            }else {
                temp.next=newNode;
            }
            temp=newNode;
        }
        temp.next=head;
        return head;
    }

    private static Node buildSeq(Node head){
        Node result=head;
        int count=2;
        head.setData(1);
        while (true){
            for (int i=0;i<count;i++){
                head=head.next;
                if (head.getData()!=0){
                    head=head.next;
                    i--;
                }
            }
            if (head.getData()==0){
                head.setData(count);
                count++;
                if (count==14){
                    break;
                }
            }
        }
        return result;
    }
    static class Node{

        private int data;
        private Node next;

        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;
        }
    }
}