1.找出一維數組中的最大元素(找出最小元素思路相同):
#include <iostream>
using namespace std;
int main()
{
int arr[5] = { 1,200,500,100,200 };
int length = sizeof(arr) / sizeof(arr[0]);//數組長度
int max = 0;
for (int i = 0; i < length; i++)
{
if (arr[i] > max)
{
max = arr[i];
}
}
cout << "最大:" << max << endl;//500
system("pause");
return 0;
}
2.逆置一維數組:
#include <iostream>
using namespace std;
int main()
{
int arr[5] = { 4,3,2,5,1};
int length = sizeof(arr) / sizeof(arr[0]);//數組長度5
int end = sizeof(arr) / sizeof(arr[0]) - 1;//數組下標4
int temp;
for (int i = 0; i < length; i++)
{
if (i >= end)
{
break;
}
temp = arr[i];
arr[i] = arr[end];
arr[end] = temp;
end--;
}
/*
逆置後打印
*/
for (int a = 0; a < length; a++)
{
cout << arr[a];//15234
}
cout << endl;
system("pause");
return 0;
}