| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
As far as I know stack.push() have a O(1) time complexity but is it actually correct if I use a stack of string.
stack<string> stringStack;
string inputString;
while(cin >> inputString) {
stringStack.push(inputString); // what is the time complexity of this line
}
It's constant, O(1).
The operation involves updating the reference or pointer to the new element, and this process is independent of the size of the string.
I'm pretty sure you're wrong. A copy of
inputStringis added to the stack; creating a copy takes time in $$$O(\text{len(inputString)})$$$.https://cplusplus.com/reference/stack/stack/push/
"The content of this new element is initialized to a copy of val."
I think you're right, a good solution would be a stack of pointers of references to strings, so the time to push them is constant as they're basically an adress
I appreciate your response, I'll make sure to fix my mistake right away :)
There is second overload which moves instead of copying https://en.cppreference.com/w/cpp/container/stack/push