Java用循环链表实现魔术师发牌问题和拉丁方阵

小咪咪 2023-07-09 02:27 10阅读 0赞

[*点击进入尚硅谷数据结构和算法Java代码导航*][Java]

public class Test {
        
    
    	private class Node{
        
    		Node next = null;
    		int data;
    		public Node(int t) {
        
    			this.data = t;
    		}
    	}
    	private Node head;
    	private int len;
    	public Test() {
        
    		this.head = new Node(0);
    		this.len = 0;
    		this.head.next = head;
    	}
    	
    	//获取第Index个节点
    	public Node getNode(int index) {
        
    		if(index<0 || index>len) {
        
    			throw new ArrayIndexOutOfBoundsException("Index error");
    		}
    		Node temp = head;
    		for(int i=0;i<index;i++) {
        
    			temp = temp.next;
    		}
    		return temp;
    	}
    	
    	//向链表尾部加入节点
    	public void addTail(int t) {
        
    		Node node = new Node(t);
    		Node temp = getNode(len);
    		node.next = temp.next;
    		temp.next = node;
    		this.len++;
    	}
    	
    	//输出链表
    	public void print() {
        
    		Node temp = head;
    		for(int i=0;i<=len;i++) {
        
    			System.out.print(temp.data + " ");
    			temp = temp.next;
    		}
    		 System.out.print(" length:" + len + "\n");
    	}
    	//魔术师发牌问题
    	public void magic() {
        
    		Node last = getNode(len);
    		last.next = head.next;
    		Node temp = head;
    		int count = 1;
    		while(true) {
        
    			for(int i=0; i<count; i++) {
        
    				temp = temp.next;
    				if(temp.data != 0) {
        
    					i--;
    				}
    			}
    			temp.data = count;
    			count++;
    			if(count == 14) {
        
    				break;
    			}
    		}
    	}
    	
    	//拉丁方阵
    	public void latin(int n) {
        
    		for(int i=1; i<=n; i++) {
        
    			addTail(i);
    		}
    		Node last = getNode(len);
    		last.next = head.next;
    		Node temp = head.next;
    		Node count;
    		for(int i=1; i<=n; i++) {
        
    			count = getNode(i);
    			for(int j=0; j<n; j++) {
        
    				System.out.print(count.data + " ");
    				count = count.next;
    			}
    			System.out.println();
    			temp = temp.next.next;
    		}
    	}
    	public static void main(String[] args) {
        
    		Test tt = new Test();
    		
    		//测试magic
    //		for(int i=1; i<=13; i++) {
        
    //			tt.addTail(0);
    //		}
    //		tt.magic();
    //		tt.print();
    		
    		tt.latin(5);
    	}
    }

[Java]: https://blog.csdn.net/weixin_44963741/article/details/105228982