数组的基本操作

删除

#include<iostream>
using namespace std;
const int maxn = 1000;
int num;//数组的初始长度为0
int ary[maxn];
bool mydelete(int x)
{
    if (x < 0 || x >= num)
    {
        return false;
    }
    for (int i = x + 1; i < num; i++)
    {
        ary[i - 1] = ary[i];
    }
    num--;
    return true;
}
void show()
{
    for (int i = 0; i < num; i++)
    {
        printf("%d %s", ary[i],(i==num-1)?"\n":" ");
    }
}
int main(void)
{
    num = 6;
    for (int i = 0; i < num; i++)
    {
        ary[i] = i + 1;
    }
    mydelete(1);
    show();
    mydelete(3);
    show();
    return 0;
}

插入

#include<iostream>
using namespace std;
int num;
const int maxn = 1000;
int digit[maxn];
void show(void)
{
	for (int i = 0; i < num; i++)
	{
		printf("%d%s", digit[i], i == num - 1 ? "\n" : " ");
	}
}
bool insert(int index, int v)
{
	if (index == maxn - 1||index<0||index>maxn||index>num)
	{
		return false;
	}
	else
	{
		for (int i = num - 1; i >= index; i--)
		{
			digit[i + 1] = digit[i];
		}
		digit[index] = v;
		num++;
	}
	return true;
}
int main(void)
{
	num = 10;
	for (int i = 0; i < num; i++)
	{
		digit[i] = i + 1;
	}
	show();
	insert(0, 4);
	show();
	insert(6, 8);
	show();
	return 0;
}

数组的储存

#include<iostream>
using namespace std;
int main(void)
{
	int size = 10;
	int* a;
	a = new int[size];
	printf("%p %p\n", &a, a);
	for (int i = 0; i < size; i++)
	{
		a[i] = i;
	}
	for (int i = 0; i < 10; i++)
	{
		printf("a[%d] = %d,&a[%d] = %p\n", i, *(a + i), i,&a[i]);
	}
	return 0;
}