有关顺序表的函数操作
这里写代码片
#include<iostream>
using namespace std;
int findMin(int * x,int m);
void changeMin(int *x,int m);
void deleteX(int *x,int m);
void deleteDX(int *x,int m);
int main()
{
cout << "创建一个动态数组:" << endl;
int n;
cout << "输入数组的长度:" << endl;
cin >> n;
int * array = new int[n];
int i = 0;
//给数组中输入元素
for (i; i < n; i++)
{
cin >> array[i];
}
changeMin(array, n);
deleteDX(array, n);
return 0;
}
int findMin(int *x, int m)
{
int temp = x[0]; //记录最小值
int i = 1;
for (i; i < m; i++) //依次遍历比较 找到最小值
{
if (temp >x[i])
temp = x[i];
}
return temp;
}
void changeMin(int *x, int m)
{
int min = findMin(x,m);
for (int i = 0; i < m; i++)
{
if (x[i] == min)
{
x[i] = x[m-1];
}
}
int i = 0;
for (i ; i < m; i++)
{
cout << x[i];
}
cout << endl;
}
void deleteX(int *x, int m)
{
cout << "要删除的元素为:" << endl;
int n;
cin >> n;
int i = 0;
int length = m;
for (i; i < m; i++)
{
if (x[i] == n)
{
int j = i;
while (j < m)
{
x[j] = x[j + 1];
j = j + 1;
}
m = m - 1;
}
}
if (length != m)
{
for (i = 0; i < m; i++)
{
cout << x[i];
}
}
else
{
cout << "没找到此元素故无法删除" << endl;
}
}
void deleteDX(int *x, int m)
{
cout << "要删除的元素范围是" << endl;
int y;
int z;
cin >>y;
cout << "到";
cin >> z;
int i = 0;
int length = m;
int n = y;
while (n <= z)
{
for (i = 0; i < m; i++)
{
if (x[i] == n)
{
int j = i;
while (j < m)
{
x[j] = x[j + 1];
j = j + 1;
}
m = m - 1;
}
}
n = n + 1;
}
if (length != m)
{
for (i = 0; i < m; i++)
{
cout << x[i];
}
}
else
{
cout << "没找到此元素故无法删除" << endl;
}
}