#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

struct node {
    int val;
    node* nxt;
};



class map {
private:
    struct point;//预定义
    struct edge;
    vector<point> points;

public:
    map(int, int);
    ~map();
};

struct map::point {
    int no;
    edge* edges;
};

struct map::edge {
    int len;
    point* to;
};

map::map(int a, int b) {
    points.resize(a);
    for(auto it = points.begin(); it != points.end(); it++)//这个auto是vector<point>::iterator
        (*it).no = b;
}

map::~map() {
    points.clear();
}

map map_pointer(1, 1);

int main() {
    auto f = [](int a, int b) -> int {return a + b;};
    cout << f(25, 15) << endl;

    vector<int> aa;
    sort(aa.begin(), aa.end(), [](int x, int y) -> bool {return x > y;});

    int a = 123;
    int* p;
    p = &a;//取a的地址放进p中，使p指向a
    *p = 123;//将p所指的位置赋成123
    cout << p << ' ' << *p << endl;

    node* newnode = new node;
    delete newnode;

    node* newnode2 = (node*)malloc(sizeof(node));//void*类型强转成node*
    free(newnode2);
    
    newnode2 = (node*)calloc(sizeof(node), 10010);//calloc会自带清零
    (*newnode2).nxt = new node;
    free(newnode2);
    //不要漏内存
}