mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-24 04:54:21 +08:00
47 lines
1.3 KiB
Java
47 lines
1.3 KiB
Java
package com.thealgorithms.misc;
|
|
|
|
/**
|
|
*
|
|
*
|
|
* <h1>Find the Transpose of Matrix!</h1>
|
|
*
|
|
* Simply take input from the user and print the matrix before the transpose and
|
|
* after the transpose.
|
|
*
|
|
* <p>
|
|
* <b>Note:</b> Giving proper comments in your program makes it more user
|
|
* friendly and it is assumed as a high quality code.
|
|
*
|
|
* @author Rajat-Jain29
|
|
* @version 11.0.9
|
|
* @since 2014-03-31
|
|
*/
|
|
public final class MatrixTranspose {
|
|
private MatrixTranspose() {
|
|
}
|
|
|
|
/**
|
|
* Calculate the transpose of the given matrix.
|
|
*
|
|
* @param matrix The matrix to be transposed
|
|
* @throws IllegalArgumentException if the matrix is empty
|
|
* @throws NullPointerException if the matrix is null
|
|
* @return The transposed matrix
|
|
*/
|
|
public static int[][] transpose(int[][] matrix) {
|
|
if (matrix == null || matrix.length == 0) {
|
|
throw new IllegalArgumentException("Matrix is empty");
|
|
}
|
|
|
|
int rows = matrix.length;
|
|
int cols = matrix[0].length;
|
|
int[][] transposedMatrix = new int[cols][rows];
|
|
for (int i = 0; i < cols; i++) {
|
|
for (int j = 0; j < rows; j++) {
|
|
transposedMatrix[i][j] = matrix[j][i];
|
|
}
|
|
}
|
|
return transposedMatrix;
|
|
}
|
|
}
|