【数据结构学习笔记】数组

#include "stdafx.h"
#include <iostream>
using namespace std;
#define maxSize 100

//length要改变 使用引用类型
int insertElem(int sqList[], int &length, int p, int e) {
    if (p < 0||p>length||length==maxSize) {
        return 0;
    }
    for (int i = length - 1; i >= p; --i) {
        sqList[i + 1] = sqList[i];
    }
    sqList[p] = e;
    ++length;
    return 1;
}

//可删除元素下标p的取值范围为：0~length-1
//当表长length等于0的时候不可以再删除元素，移动元素从前往后进行
//&e删除元素取出来 p是位置

int deleteElem(int sqList[], int &length, int p, int &e) {
    if (p<0||p>length-1) {
        return 0;
    }
    e = sqList[p];
    for (int i = p; i < length - 1;++i) {
        sqList[i] = sqList[i + 1];
    }
    --length;
    return 1;
}

void main() {

    int sqList[maxSize] = { 1,2,3,4,5,6,7 };
    int length = 7;
    for (int i = 0; i < length - 1;i++) {
        cout << "原数组第"<<i<<"个位置： " << sqList[i] << endl;
    }
    int l = sizeof(sqList) / sizeof(sqList[0]);
    

    int r = insertElem(sqList, length, 3, 9);
    cout << "插入元素返回 " << r << endl;

    for (int i = 0; i < 7; i++) {
        cout << "新数组第" << i << "个位置： " << sqList[i] << endl;
    }


}