LC.P950[按递增顺序显示卡牌]

发表于2023-07-20|更新于2023-07-20|LeetCode

|字数总计:94|阅读时长:1分钟|阅读量:

方法一：队列模拟

class Solution {
    public int[] deckRevealedIncreasing(int[] deck) {
        int n = deck.length;
        Deque<Integer> queue = new ArrayDeque<>();
        for (int i = 0; i < n; ++i) queue.offer(i);
        int[] ans = new int[n];
        Arrays.sort(deck);
        for (int x : deck) {
            ans[queue.poll()] = x;
            if (!queue.isEmpty()) queue.offer(queue.poll());
        }
        return ans;
    }
}