NC131 数据流中的中位数

插入排序

import java.util.*;


// 插入排序
public class Solution {

        private List<Integer> list = new ArrayList<>();
        public void Insert(Integer num) {
            if (list.isEmpty()){
                list.add(num);
                return;
            }

            // 找到需要插入的位置
            int i = 0;
            for (; i < list.size();i++){
                if (num < list.get(i)){
                    break;
                }
            }
            // 插入对应的位置
            list.add(i, num);
        }

        public Double GetMedian() {
            int n = list.size();
            if (n % 2 != 0){
                return (double)list.get(n / 2);
            }
            int x = list.get(n / 2);
            int y = list.get((n / 2 ) - 1);
            return (double) ( x + y ) / 2;
        }


}

优先队列

package com.company.test.数据流中的中位数;

import java.util.PriorityQueue;

/**
 * @author xienl
 * @description public void Insert(Integer num) {          }      public Double GetMedian() {              }
 * @date 2022/8/29
 */

// 优先队列
public class Solution2 {
    public static void main(String[] args) {
        Solution2 solution = new Solution2();
        solution.Insert(5);
        System.out.println(solution.GetMedian());
        solution.Insert(2);
        System.out.println(solution.GetMedian());
        solution.Insert(3);
        System.out.println(solution.GetMedian());
        solution.Insert(4);
        System.out.println(solution.GetMedian());
    }


    PriorityQueue<Integer> max = new PriorityQueue<>(); // 从小到大排序
    PriorityQueue<Integer> min = new PriorityQueue<>((a, b) -> b - a); // 从大到小排序
    public void Insert(Integer num) {
        min.offer(num);
        max.offer(min.poll());
        if (min.size() < max.size()){
            min.offer(max.poll());
        }
    }

    public Double GetMedian() {
        if (min.size() > max.size()){
            return (double)min.peek();
        }
        return (double)(min.peek() + max.peek()) / 2;
    }
}