TheAlgorithms/Python
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

black fixes and Travis CI fixes (#2160)

Browse Source 
* black format

* updating DIRECTORY.md

* fixes

* fixup! Format Python code with psf/black push

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
vinayak
2020-07-02 20:02:15 +05:30
committed by GitHub
parent c534e77cb1
commit 2d3d660155
7 changed files with 11 additions and 43 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
dynamic_programming/minimum_cost_path.py
View File

@@ -4,7 +4,7 @@ from typing import List
def minimum_cost_path(matrix: List[List[int]]) -> int:
'''
"""
Find the minimum cost traced by all possible paths from top left to bottom right in
a given matrix
@@ -13,7 +13,7 @@ def minimum_cost_path(matrix: List[List[int]]) -> int:
>>> minimum_cost_path([[2, 1, 4], [2, 1, 3], [3, 2, 1]])
7
'''
"""
# preprocessing the first row
for i in range(1, len(matrix[0])):