Could anyone please tell is there any alternative for pbds in java. I searched in the net but could find nothing. So is it that java users implement BIT or segment tree when c++ users use pbds or do they have some shortcuts ?
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | adamant | 155 |
4 | cry | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
Could anyone please tell is there any alternative for pbds in java. I searched in the net but could find nothing. So is it that java users implement BIT or segment tree when c++ users use pbds or do they have some shortcuts ?
Name |
---|
If you're looking or an equivalent to the pbds ordered set/map, TreeSet and TreeMap might offer what you're looking for. You can simulate
find_by_order
withtoArray
andorder_of_key
by getting the size of theheadMap
. I don't know what sort of efficiency these would come with though, you would have to benchmark them.I see the community is so much toxic that users are forced to ask genuine questions using new account. It makes me sad.
//PBDS JAVA CODE private static class AVLTreePBDS { private Node root; private boolean multi;
// cur.key == key return size(cur.left);
I guess the function order_of_key method in C++ does the job in O(logn) time. But in java taking headSet(element).size() takes O(n) time. Isn't there any other method in java which does the same in O(logn) time?