#include <iostream>
using namespace std;
int *ptr;
int max(int n)
{
ptr = new int[n];
for(int i=0;i<n;i++){
ptr[i]=i+100;
cout<<ptr[i]<<" ";
}
cout<<"最大值是:"<<endl;
int max=ptr[0];
for(int i=0;i<5;i++){
if(ptr[i]>max){
max=ptr[i];
}
}
return max;
}
void main(){
int n=5;
cout<<max(n)<<endl;
delete ptr;
}
2.二维的动态分配:
#include <iostream>
#include<ctime>
using namespace std;
int count=0;
int even(int n){
srand((unsigned)time(NULL));
int (*ptrB)[4];
ptrB = new int[n][4];
for(int i=0;i<n;i++)
{
for(int j=0;j<4;j++)
{
ptrB[i][j]=rand()%90+10;
cout<<ptrB[i][j]<<" ";
}
cout<<endl;
}
cout<<"偶数个数是:";
for(int i=0;i<n;i++)
{
for(int j=0;j<4;j++)
{
if(ptrB[i][j]%2==0) //偶数计数
count++;
}
}
delete[]ptrB;
return count;
}
void main()
{
int n=3,p;
p=even(n);
cout<<p<<endl;
}
3. 用一维的数组表示二维的数组:
#include <iostream>
#include<ctime>
using namespace std;
int count=0;
int even(int n,int m){
srand((unsigned)time(NULL));
int *ptrB;
ptrB = new int[n*m];
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
ptrB[i*n+j]=rand()%90+10;
cout<<ptrB[i*n+j]<<" ";
}
cout<<endl;
}
cout<<"偶数个数是:";
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(ptrB[i*n+j]%2==0)
count++;
}
}
return count;
delete[]ptrB;
}
void main()
{
int p;
p=even(3,4);
cout<<p<<endl;
}