尋找2D鋸齒陣列中元素數量的標準方法是什麼？

Question

public static double PrazenWindowDensity(double [][] Xn, double x, double sigma2) 
    { 
     double gauss = 0; 

     foreach(double [] arr in Xn) 
     { 
      foreach (double item in arr) 
      { 
       double xx = GausianFunction(item, x, sigma2); 
       gauss += xx; 
      } 
     } 

     return gauss/Xn.Length; //this is surely incorrect. Isn't it? 
    } 

我可以在這裏寫什麼？

return gauss/Xn.Length; 

Answer 1

最快和最簡單的方法我認爲是

public static double PrazenWindowDensity(double[][] Xn, double x, double sigma2) 
{ 
    double gauss=0; 
    int count=0; 
    for (int i=0; i<Xn.Length; i++) 
    { 
     gauss+=Xn[i].Sum((item) => GausianFunction(item, x, sigma2)); 
     count+=Xn[i].Length; 
    } 
    return gauss/count; 
} 

Answer 2

這似乎是一個滿意的答覆，所以我會繼續和張貼爲一體。

return gauss/Xn.Sum(x => x.Length);