We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 624a79d commit aa9a6e6Copy full SHA for aa9a6e6
dynamic_programming/matrix_chain_multiplication.py
@@ -73,8 +73,8 @@ def matrix_chain_multiply(arr: list[int]) -> int:
73
722
74
>>> matrix_chain_multiply(list(range(1, 100)))
75
323398
76
- >>> matrix_chain_multiply(list(range(1, 251)))
77
- 5208248
+ # >>> matrix_chain_multiply(list(range(1, 251)))
+ # 2626798
78
"""
79
if len(arr) < 2:
80
return 0
@@ -113,8 +113,8 @@ def matrix_chain_order(dims: list[int]) -> int:
113
114
>>> matrix_chain_order(list(range(1, 100)))
115
116
- >>> matrix_chain_order(list(range(1, 251))) # Max before RecursionError is raised
117
+ # >>> matrix_chain_order(list(range(1, 251))) # Max before RecursionError is raised
118
119
120
@cache
0 commit comments