I came across a question where I have to store to pair in PriorityQueue in Java. But Java does not have anything like make_pair in C++. What can be the alternate used in Java for making a pair?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
I came across a question where I have to store to pair in PriorityQueue in Java. But Java does not have anything like make_pair in C++. What can be the alternate used in Java for making a pair?
Name |
---|
The simplest way would probably be making your own pair class and defining a custom comparator.
Still not available in Java standard library. So all you need is to switch to Scala :)
That’s a weird way to spell C++.
Lol. If that was spelt C++, you would probably see another blog post titled "alternative for BigInteger in C++"
You need to create a java class for pair an implementation is given below :
class pair implements Comparable{ int a,b;
pair class implements comparable interface because priority queue will use this interface compareTo method to compare elements.
you can define priority queue as follows
Got it!. Thanks.
Abit weird method but if the numbers in your pair are small enough, you insert then into your priority queue by inserting a*(constant)+b.