Josephu问题实现

最新推荐文章于 2019-10-18 15:38:23 发布

原创最新推荐文章于 2019-10-18 15:38:23 发布 · 136 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java

java 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一个基于约瑟夫环问题的实现案例，使用Java编程语言通过单向循环链表模拟了约瑟夫环问题的经典场景，并实现了指定人数及淘汰规则下的生存者查找。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package com.acm;

import java.util.ArrayList;
import java.util.List;

import com.bean.Node;

public class Josephu {
	public static void generate(){
		int totalP = 41;
		int dead = 3;

		List<String> list = new ArrayList<String>();
		for(int i = 2;i <= totalP;i++){
			if( i == 16){
				list.add("Josephu's friend " + i);
			}else if(i == 31){
				list.add("Josephu " + i);
			}else{
				list.add("" + i);
			}
		}

		Node<String> head = new Node<String>("1");

		SingleCycleLinkedList<String> scll = new SingleCycleLinkedList<String>(head, list);
		Node<String> current = head;
		while(scll.size(current) > 3){
			for(int i = 0;i < dead - 2;i++){
				current = current.getNext();
			}
			current.setNext(current.getNext().getNext());
			current = current.getNext();
		}

		print(current);
	}

	public static void print(Node<String> head){
		Node<String> current = head;

		do{
			System.out.println(current.getData());
			current = current.getNext();
		}while(current.getNext() != head);
	}

	public static void main(String[] args) {
		generate();
	}
}