/// <summary>
/// 求一个矩阵的转置矩阵
/// </summary>
/// <param name="matrix">矩阵</param>
/// <returns>转置矩阵</returns>
private static double[][] MatrixTranspose(double[][] matrix)
{
//合法性检查
if (!isMatrix(matrix))
{
throw new Exception("matrix 不是一个矩阵");
}
//矩阵中没有元素的情况
if (matrix.Length == 0)
{
return new double[][] { };
}
double[][] result = new double[matrix[0].Length][];
for (int i = 0; i < result.Length; i++)
{
result[i] = new double[matrix.Length];
}
//新矩阵生成规则: b[i,j]=a[j,i]
for (int i = 0; i < result.Length; i++)
{
for (int j = 0; j < result[0].Length; j++)
{
result[i][j] = matrix[j][i];
}
}
return result;
}
/// <summary>
/// 判断一个二维数组是否为矩阵
/// </summary>
/// <param name="matrix">二维数组</param>
/// <returns>true:是矩阵 false:不是矩阵</returns>
private static bool isMatrix(double[][] matrix)
{
//空矩阵是矩阵
if (matrix.Length < 1) return true;
//不同行列数如果不相等,则不是矩阵
int count = matrix[0].Length;
for (int i = 1; i < matrix.Length; i++)
{
if (matrix[i].Length != count)
{
return false;
}
}
//各行列数相等,则是矩阵
return true;
}
/// <summary>
/// 打印矩阵
/// </summary>
/// <param name="matrix">待打印矩阵</param>
private static void PrintMatrix(double[][] matrix)
{
for (int i = 0; i < matrix.Length; i++)
{
for (int j = 0; j < matrix[i].Length; j++)
{
Console.Write(matrix[i][j] + "\t");
//注意不能写为:Console.Write(matrix[i][j] + '\t');
}
Console.WriteLine();
}
}
static void Main(string[] args)
{
double[][] matrix = new double[][]
{
new double[] { 1, 2, 3, 4 },
new double[] { 4, 5, 6, 7 },
new double[] { 7, 8, 9, 10}
};
//打印矩阵
PrintMatrix(matrix);
Console.WriteLine();
//打印转置后矩阵
PrintMatrix(MatrixTranspose(matrix));
Console.WriteLine();
Console.ReadLine();
}
机械节能产品生产企业官网模板...
大气智能家居家具装修装饰类企业通用网站模板...
礼品公司网站模板
宽屏简约大气婚纱摄影影楼模板...
蓝白WAP手机综合医院类整站源码(独立后台)...苏ICP备2024110244号-2 苏公网安备32050702011978号 增值电信业务经营许可证编号:苏B2-20251499 | Copyright 2018 - 2025 源码网商城 (www.ymwmall.com) 版权所有