| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3443 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | djm03178 | 155 |
| 9 | TheScrasse | 154 |
| 10 | Dominater069 | 153 |
#include <vector>
#include <utility>
#include <cassert>
int main() {
std::vector<int> vec;
vec.push_back(0);
int & r = vec[0];
if (r == 0) {
r = 1;
vec.push_back(0);
}
assert(r > 0);
return 0;
}
Find out why this code is dangerous :D
I became a victim of this problem while solving a problem using logic similar to the code shown.
By inserting another element, the vector will double its capacity and thus the memory address may change. Is it correct?
You are right
It's dangerous because in the second push_back, the vector reallocates new array of double length, and deletes the old one. (If you don't know how vector works, see this.)
Hence, r becomes pointing to an invalid memory position, so its value will be just garbage. One way to make sure of this, is to add the following line before doing any push_backs.