第一种优点 M[i][j];

第二种 必须 A[ i*col+j]=M[i][j];

include [i]

include

include

using namespace std;

int main(int agrn, char **agrv)

{

int row, col;

int i,j;

row=5000, col=1000;

    clock_t start, finish;

start=clock();

int **M;

M=new int*[row];

for ( i=0; i

for ( i=0; i

finish=clock();

cout

    start=clock();

int A=new int[rowcol];

    for ( i=0; i

cout

我run的是 后一个快.

by ArisZheng
金融工程, 数学算法, CPP, 算法