From 9bf1b7807594e6e05422a6c887f9ed6e4551e702 Mon Sep 17 00:00:00 2001 From: Ankit Rai Date: Sat, 19 Oct 2019 18:18:33 +0530 Subject: [PATCH] 18 done in Py3 --- Python/18. Maximum_path_sum/ankitRai96.py | 27 +++++++++++++++++++++++ README.md | 2 +- 2 files changed, 28 insertions(+), 1 deletion(-) create mode 100644 Python/18. Maximum_path_sum/ankitRai96.py diff --git a/Python/18. Maximum_path_sum/ankitRai96.py b/Python/18. Maximum_path_sum/ankitRai96.py new file mode 100644 index 0000000..4899f41 --- /dev/null +++ b/Python/18. Maximum_path_sum/ankitRai96.py @@ -0,0 +1,27 @@ +triangle = [ + [75], + [95, 64], + [17, 47, 82], + [18, 35, 87, 10], + [20, 4, 82, 47, 65], + [19, 1, 23, 75, 3, 34], + [88, 2, 77, 73, 7, 63, 67], + [99, 65, 4, 28, 6, 16, 70, 92], + [41, 41, 26, 56, 83, 40, 80, 70, 33], + [41, 48, 72, 33, 47, 32, 37, 16, 94, 29], + [53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14], + [70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57], + [91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48], + [63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31], + [4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23], +] + +def FindMaxSum(t): + for i in range(len(t)-2,-1,-1): + for y in range(i+1): + t[i][y] += max(t[i+1][y], t[i+1][y+1]) + # print(f'i: {i} | y: {y} | t[x][y]: {t[i][y]}') + return t[0][0] + +if __name__ == '__main__': + print(FindMaxSum(triangle)) \ No newline at end of file diff --git a/README.md b/README.md index 930ec01..cb82358 100644 --- a/README.md +++ b/README.md @@ -46,7 +46,7 @@ Happy Contributing! 😃 | 15 | [Lattice paths](https://projecteuler.net/problem=15) | | | | | | | | | | | | | | 16 | [Power digit sum](https://projecteuler.net/problem=16) | | :white_check_mark:| | :white_check_mark: | | | | | | | | | | 17 | [Number letter counts](https://projecteuler.net/problem=17) | | | |:white_check_mark: | | | | | | | | | -| 18 | [Maximum path sum I](https://projecteuler.net/problem=18) | | | | | | | | | | | | | +| 18 | [Maximum path sum I](https://projecteuler.net/problem=18) | | | | :white_check_mark: | | | | | | | | | | 19 | [Counting Sundays](https://projecteuler.net/problem=19) | | | | | | | | | | | | | | 20 | [Factorial digit sum](https://projecteuler.net/problem=20) | | | | :white_check_mark: | | | | | | | | | | 21 | [Amicable numbers](https://projecteuler.net/problem=21) | | | | | | | | | | | | |