田忌赛马

    public static int[] advantageCount(int[] A,int[] B){
        int[] sortB = B.clone();
        Arrays.sort(sortB);
        Arrays.sort(A);

        Map<Integer, Deque<Integer>> bMap = new HashMap<>();
        for (int b : B){
            bMap.put(b,new LinkedList<>());
        }
        Deque<Integer> aq = new LinkedList<>();
        int j = 0;
        for (int a : A){
            if (a > sortB[j]){
                bMap.get(sortB[j++]).add(a);
            }else {
                aq.add(a);
            }
        }
        int[] ans = new int[A.length];
        for (int i = 0;i<B.length;i++){
            if(bMap.get(B[i]).size()>0){
                ans[i] = bMap.get(B[i]).removeLast();
            }else {
                ans[i] = aq.removeLast();
            }
        }
        return ans;
    }

 https://www.bilibili.com/video/BV1Aq4y137ro/?p=20 

posted @ 2023-10-28 23:50  樱圃  阅读(4)  评论(0编辑  收藏  举报