指针与指针内存储地址的关系

#pragma region 指针++，指针内存储的地址增加m位，m根据存储内容的所占字节数的大小决定

//这里通过一个顺序表来说明这一关系
using namespace std;
typedef int Status;
typedef int ElemType;
constexpr auto MAXSIZE = 100;// 最大长度;
typedef struct SqList {
    ElemType *elem;//基地址
    int length;//实际长度
}SqList;

Status InitLsit_Sq(SqList &L) {//构造一个空的顺序表；&表示可以双向传递，实参把值传给形参，形实合一
    L.elem = new ElemType[MAXSIZE];//为顺序表分配空间；new申请MAXSIZE个ElemType类型的空间
    if (!L.elem) exit(OVERFLOW);//存储空间分配失败
    L.length = 0;//空表长度为0
    return 1;
}

Status ListInsert_Sq(SqList &L, int i, ElemType e) {//有返回值
    if (i<1 || i>L.length + 1) return 0;//判断插入位置是否合法
    if (L.length == MAXSIZE) return 0;//判断存储空间是否已满
    for (int j = L.length; j >= i - 1; j--) {//n到i元素向后移动
        L.elem[j + 1] = L.elem[j];
    }
    L.elem[i - 1] = e;//e放置第i个位置
    ++L.length;//表长+1
    return 0;
}

//根据元素内容e获取元素位置i
int LocateElem(SqList L, ElemType e) {
    //查找不影响线性表长度和内容，实参内容值已被用户给出
    for (int i = 0; i < L.length; i++)
        if (L.elem[i] == e) return i + 1;
    return 0;//当for语句表达式为假||if表达式为假时执行return 0
}
#pragma endregion

int main()
{
    SqList B;//B为创建顺序表的名称
    InitLsit_Sq(B);
    //顺序表B的值依次为2、3、4
    ListInsert_Sq(B, 1, 2);
    ListInsert_Sq(B, 2, 3);
    ListInsert_Sq(B, 3, 4);
    int *p1 = &(B.elem[0]);
    int *p2 = &(B.elem[1]);
    int *p3 = &(B.elem[2]);
    int *p4 = p1++;//先赋值给p4，然后作p1++
    printf("%0x, %0x, %d, %d\n", p1, &(B.elem[0]), *p1, (B.elem[0]));
    printf("%0x, %0x, %d, %d\n", p2, &(B.elem[1]), *p2, (B.elem[1]));
    printf("%0x, %0x, %d, %d\n", p3, &(B.elem[2]), *p3, (B.elem[2]));
    printf("%0x, %0x, %d, %d\n", p4, &(B.elem[0]), *p4, (B.elem[0]));
}