代码如下;
#include <iostream>
using namespace std;
int main()
{
int a[11]; // 让数组有一定存储空间
int insertNum, num, i, j;
int deleteIndex;
cout << "输入数组:";
for (int i = 0; i < 10; i++)
{
cin >> a[i];
}
cout << endl;
cout << "请输入一个数:";
cin >> insertNum;
// 插入
if (insertNum > a[9])
{
a[10] = insertNum;// 直接放在数组最后面
}
else
// 插值重排
{
for (i = 0; i < 10; i++)
{
if (a[i] > insertNum)
{
for (j = 9; j >= i; j--)
{
a[j + 1] = a[j];
}
a[i] = insertNum;
break;
}
}
}
cout << "插入后:";
for (i = 0; i < 11; i++) // i<11是实现数组长度加1
{
cout << a[i] << " ";
}
cout << endl;
// 删除
cout << "请输入一个数:";
cin >> num;
for (int i = 0; i < 11; i++)
{
//找到了
if (num == a[i])
{
deleteIndex = i;
break;
}
}
for (i = deleteIndex; i < 10; i++) //从找到的索引开始比较移位
{
a[i] = a[i + 1];
}
cout << "删除后:";
for (i = 0; i < 10; i++)
{
cout << a[i] << " ";
}
cout << endl;
return 0;
}