JAVA实现约瑟夫算法

尝试用java的自定义双向循环链表实现约瑟夫算法。

在C语言里很简单的问题，知道算法的情况下竟然也搞了2个小时。。

首领元素：

package com.app;

public class man {
    private int Id;

    public int getId() {
        return Id;
    }

    public void setId(int id) {
        Id = id;
    }
    
    public void sayMan(){
        System.out.println("I am the Leander" + Id);
    }
}

节点类：

package com.app;

public class node<object> {
    public object ob;
    public node<object> next;
    public node<object> pre;
    
    public node(){
        
    }
    
    public node(object ob1){
        ob = ob1;
        next = null;
        pre  = null;
    }
}

循环链表：

package com.app;

public class linkList<T> {
    
    private node<T> list;
    private int num;
    
    /*-12
     * 初始化循环队列
     * @number:队列的大小
*/
    public linkList(){
        list = new node<T>();
        num  = 0;
    }
    
    public void deleteNode(node<T> input){
        node<T> temp;
        if(num < 1){
            System.out.println("error");
            
            return;
        }
        
        if(list == input){
            list = input.next;
        }
        
        temp = input;
        input.pre.next = temp.next;
        input.next.pre = temp.pre;
        
        num--;
        
    }
    
    public void deleteNode(int index){
        node<T> temp;
        int count = 0;
        if((0 == index)||(0 == index%num)){
            /*删除队头 */
            if(1 == num){
                num = 0;
            }else{
                temp = list;
                list.next.pre = temp.pre;
                list.pre.next = temp.next;
                list = temp;
            }
        }else{
            temp = list;
            while(0 != count){
                temp = temp.next;
            }
            
            temp.pre.next = temp.next;
            temp.next.pre = temp.pre;        
            num--;
        }
        
        return;
    }
    
    public node<T> getNode(int index){
        node<T> temp;
        int count = 0;
        
        count = index;
        
        temp = list;
        while(0 != count){
            temp = temp.next;
            count--;
        }
        
        return temp;    
    }
    
    public void addNode(T input){
        node<T> temp;
        
        if(0 == num){
            list = new node<T>(input);
            list.next = list;
            list.pre  = list;
            num++;
        }else{
            node<T> nd;
            nd = getNode(num - 1);
            
            temp = new node<T>(input);
            nd.next   = temp;
            temp.pre  = nd;
            temp.next = list;
            list.pre  = temp;
            num++;
        }
    }

    public int getNum() {
        return num;
    }

    public node<T> getList() {
        return list;
    }
}

选首领：

package com.app;

public class pickApp {
    private int queneNum;
    private int pickNum;
    
    public pickApp(int num1, int num2){
        queneNum = num1;
        pickNum  = num2;
    }
    
    public void pickTheHeader(){
        
        /*初始化队列 */
        linkList<man> list = new linkList<man>();
        man m;
        //初始化队列
        for(int i = 0; i < queneNum; i++){
            m = new man();
            m.setId(i + 1);            
            list.addNode(m);
        }
        
        System.out.println(list.getNum());
        
        //循环遍历队列
        for(int i = 0; i < list.getNum(); i++){
            list.getNode(i).ob.sayMan();
        }
        
        //根据pickNum选择首领
        int count = 0;
        node<man> temp = list.getList();
        node<man> temp2;
        while(list.getNum() > 1){
            if(pickNum - 1 == count){
                temp2 = temp;
                list.deleteNode(temp);
                System.out.println("delete" + temp2.ob.getId());
                temp  = temp2.next;
                count = 0;
            }else{
                temp = temp.next;
                count++;
            }
        }
        
        list.getNode(0).ob.sayMan();
        
        return;
    }
}