Breaking News: Grepper is joining You.com. Read the official announcement!

multiset in java

Wild Warbler answered on September 6, 2023 Popularity 4/10 Helpfulness 1/10

answer multiset in java

multiset in java

Comment

public static class multiset{
    public TreeMap<Integer,Integer> map;
    public int size=0;
    public multiset(){
        map=new TreeMap<>();
    }
    public multiset(int[] a){
        map=new TreeMap<>();
        size=a.length;
        for(int i=0;i<a.length;i++){
            map.put(a[i], map.getOrDefault(a[i], 0)+1);
        }
    }
    void add(int a){
        size++;
        map.put(a, map.getOrDefault(a, 0)+1);
    }
    void remove(int a){
        size--;
        int val=map.get(a);
        map.put(a, val-1);
        if(val==1)map.remove(a);
    }
    void removeAll(int a){
        if(map.containsKey(a))
        {
            size-=map.get(a);
            map.remove(a);
        }
    }
    int ceiling(int a){
        if (map.ceilingKey(a) != null) {
            int find = map.ceilingKey(a);
            return find;
        }else return Integer.MIN_VALUE;
    }
    int floor(int a){
        if (map.floorKey(a) != null) {
            int find = map.floorKey(a);
            return find;
        }else return Integer.MAX_VALUE;
    }
    int lower(int a){
        if (map.lowerKey(a) != null) {
            int find = map.lowerKey(a);
            return find;
        }else return Integer.MAX_VALUE;
    }
    int higher(int a){
        if (map.higherKey(a) != null) {
            int find = map.higherKey(a);
            return find;
        }else return Integer.MIN_VALUE;
    }
    int first(){
        return map.firstKey();
    }
    int last(){
        return map.lastKey();
    }
    boolean contains(int a){
        if(map.containsKey(a))return true;
        return false;
    }
    int size(){
        return size;
    }
    void clear(){
        map.clear();
    }
    int poll(){
        if(map.size()==0){
            return Integer.MAX_VALUE;
        }
        size--;
        int first=map.firstKey();
        if(map.get(first)==1){
            map.pollFirstEntry();
        }else map.put(first, map.get(first)-1);
        return first;
    }
    int polllast(){
        if(map.size()==0){
            return Integer.MAX_VALUE;
        }
        size--;
        int last=map.lastKey();
        if(map.get(last)==1){
            map.pollLastEntry();
        }else map.put(last, map.get(last)-1);
        return last;
    }
}

Popularity 4/10 Helpfulness 1/10 Language java

Source: stackoverflow.com

Tags: java multiset

Link to this answer
Share Copy Link

Contributed on Sep 06 2023

Wild Warbler

0 Answers Avg Quality 2/10

multiset in java

Contents

More Related Answers

multiset in java

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.