UVA 10935 Java

最新推荐文章于 2021-08-22 21:11:31 发布

galesaur_wcy

最新推荐文章于 2021-08-22 21:11:31 发布

阅读量326

点赞数

分类专栏： JAVA初学

本文链接：https://blog.csdn.net/galesaur_wcy/article/details/81365462

版权

JAVA初学专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一个有趣的算法问题——丢牌问题。通过给定数量的有序纸牌堆，执行特定操作直至剩下最后一张牌，文章详细阐述了解决该问题的Java实现过程，并提供了一个完整的示例代码。特别注意处理边界条件如当牌数为1的情况。

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

Problem B: Throwing cards away I

Given is an ordered deck ofn cards numbered 1 to n with card 1 at the top and card n at the bottom. The following operation is performed as long as there are at least two cards in the deck:

Throw away the top card and move the card that is now on the top of the deck to the bottom of the deck.

Your task is to find the sequence of discarded cards and the last, remaining card.

Each line of input (except the last) contains a number n ≤ 50. The last line contains 0 and this line should not be processed. For each number from the input produce two lines of output. The first line presents the sequence of discarded cards, the second line reports the last remaining card. No line will have leading or trailing spaces. See the sample for the expected format.

Sample input

Output for sample input

Discarded cards: 1, 3, 5, 7, 4, 2
Remaining card: 6
Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14
Remaining card: 6
Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8
Remaining card: 4
Discarded cards: 1, 3, 5, 2, 6
Remaining card: 4

自己wa了主要问题是当n == 1 的时候没有考虑

//package util;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		Scanner sc =  new Scanner (System.in);
		Queue<Integer> qu = new LinkedList<Integer>();//普通队列先进先出
		Queue<Integer> over = new LinkedList<Integer>();//普通队列先进先出
		int n ;
		while(sc.hasNext()) {
			qu.clear();
			over.clear();
			n = sc.nextInt();
			if(n == 0)
				break;
			else if(n == 1) {
				System.out.print("Discarded cards:\n");
				System.out.print("Remaining card: 1"+"\n");
				continue;
			}
			for(int i = 1; i <= n; i++) {
				qu.add(i);
			}//把元素添加进去
			
			while(qu.size() != 1 ) {
				over.add(qu.poll());
				qu.add( qu.poll() );
			}	
			System.out.print("Discarded cards: "+over.poll());
			while(over.isEmpty() == false) {
				System.out.print(", "+over.poll());
			}
			System.out.println();
			System.out.print("Remaining card: "+qu.poll()+"\n");
		}
	}
}