指針與指針內存儲地址的關系

#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]));
}