December 2019
— You can convert it to a set and back to a list
I've finally do it: for (auto it = points.begin(); it != prev(points.end()); it++) { auto it2 = next(it); while (it2 != points.end()) { if (it->x == it2->x && it->y == it2->y && it->z == it2->z) it2 = points.erase(it2); else ++it2; } }
for (auto it = points.begin(); it != prev(points.end()); it++) { auto it2 = next(it); while (it2 != points.end()) { if (it->x == it2->x && it->y == it2->y && it->z == it2->z) it2 = points.erase(it2); else ++it2; } }
— Looks like a very high complexity
— O(n2)
— Hello
— How do not escape from size of array?
— Wat
— Purge complete.
— Wow
— vbextreme, learn this please againhttps://stackoverflow.com/questions/2397984/undefined-unspecified-and-implementation-defined-behavior
Message permanent page
— You Need to read code written by other developer
— Written*and yes, I've done it is not once