典型的数组处理

找出数组中的最大元素:

double max = a[0];

for ( int i = 0, i < a.length, i++ ) {

  if a[i] > max {

    max = a[i];

  }

}

 

计算数组元素的平均值:

int N = a.length; 

double sum = 0.0;

for ( int i = 0, i<a.length, i++ ) {

  sum += a[i] ;

}

double average = sum/N;

 

复制数组:

int N = a.length;

double[] b = new double[N]; 

for ( int = 0, i<a.length, i++) {

  b[i] = a[i];

}

 

颠倒数组元素的顺序:

int N = a.length;

for ( i =0, i<N/2 , i++) {

  double temp = a[i];

  a[i] = a[N-1-i];

  a[N-1-i] = temp;

}

 

矩阵相乘(方阵)a[][]*b[][] = c[][]

int N = a.length;

double[][] c = new double[][];

for ( int i = 0; i < N; i++ ) {

  for ( int j=0, j < N; j++ ) {

    //计算行i和列j的点乘

    for ( int k = 0, k < N, K++) {

      c[i][j] += a[i][k] * b[k][j];

    }

  }

}

posted @ 2017-05-12 11:14  sinpi  阅读(143)  评论(0)    收藏  举报