-
-
Notifications
You must be signed in to change notification settings - Fork 50.5k
Expand file tree
/
Copy pathmatrix_diagonal_sum.py
More file actions
66 lines (49 loc) · 1.71 KB
/
matrix_diagonal_sum.py
File metadata and controls
66 lines (49 loc) · 1.71 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
"""
Matrix Multiplication Algorithm
This function performs matrix multiplication on two valid matrices.
It follows the mathematical definition:
If A is an m×n matrix and B is an n×p matrix,
then their product C is an m×p matrix.
Raises:
ValueError: if matrices have invalid structure or incompatible sizes.
Sources:
https://en.wikipedia.org/wiki/Matrix_multiplication
Examples:
>>> A = [[1, 2], [3, 4]]
>>> B = [[5, 6], [7, 8]]
>>> matrix_multiply(A, B)
[[19, 22], [43, 50]]
>>> matrix_multiply([[1, 2, 3]], [[4], [5], [6]])
[[32]]
# Invalid structure
>>> matrix_multiply([[1, 2], [3]], [[1, 2]])
Traceback (most recent call last):
...
ValueError: Invalid matrix structure
# Incompatible sizes
>>> matrix_multiply([[1, 2]], [[1, 2]])
Traceback (most recent call last):
...
ValueError: Incompatible matrix sizes
"""
from typing import List
def matrix_multiply(A: List[List[float]], B: List[List[float]]) -> List[List[float]]:
if not _is_valid_matrix(A) or not _is_valid_matrix(B):
raise ValueError("Invalid matrix structure")
rows_A = len(A)
cols_A = len(A[0])
rows_B = len(B)
cols_B = len(B[0])
if cols_A != rows_B:
raise ValueError("Incompatible matrix sizes")
result = [[0.0 for _ in range(cols_B)] for _ in range(rows_A)]
for i in range(rows_A):
for j in range(cols_B):
for k in range(cols_A):
result[i][j] += A[i][k] * B[k][j]
return result
def _is_valid_matrix(M: List[List[float]]) -> bool:
if not isinstance(M, list) or not M:
return False
first_length = len(M[0])
return all(isinstance(row, list) and len(row) == first_length for row in M)