CppCoreGuidelines P.11 通过封装整理混乱代码

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int sz = 10;
    int* p = (int*) malloc(sizeof(int) * sz);
    int count = 0;
    int input_max = 20;
    int input_val = 0;
    for (;;) {
        int x = input_val++;
        if (input_val > input_max) break;
        if (count == sz)
            p = (int*) realloc(p, sizeof(int) * sz * 2);
        p[count++] = x;
    }
    for (int i=0; i<count; i++) cout << p[i] << " ";
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
    vector<int> v;
    v.reserve(10);
    int input_max = 20;
    int input_val = 0;
    for (;;) {
        int x = input_val++;
        if (input_val > input_max) break;
        v.push_back(x);
    }
    ranges::for_each(v, [](const auto &x){cout << x << " ";});
    return 0;
}