What is the complexity of st.erase(st.begin())?
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
What is the complexity of st.erase(st.begin())?
Name |
---|
It should be O(logn)
so this code will has O(NlogN), right? :>
If I understand correctly, inside the while cycle you are comparing a set to another set, which has roughly O(n^2) complexity
I used string
What
st
is? What cppreference tell about it?st is string
erase it's $$$O(|st|)$$$ then
For a set, the complexity would be O(logn)
Is
st
a set? If so, then it'sO(log n)
, but it seems like yourst
is a string, in which case it'sO(n)
.