modify python solution path of 53

Author: guobinhit

README.md

@@ -891,7 +891,7 @@ You can also ask for problem solving ideas and discuss in GitHub issues directly
 |36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/learn/hash_table/_36.java) & Python |![medium](https://github.com/guobinhit/myleetcode/blob/master/images/medium.png)| Array
 |38|[Count and Say](https://leetcode.com/problems/count-and-say/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/strings/_38.java) & Python |![easy](https://github.com/guobinhit/myleetcode/blob/master/images/easy.png)| Strings
 |48|[Rotate Image](https://leetcode.com/problems/rotate-image/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/array/_48.java) & Python |![medium](https://github.com/guobinhit/myleetcode/blob/master/images/medium.png)| Array
-|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/dynamic_programming/_53.java) & [Python](https://github.com/guobinhit/myleetcode/blob/master/codes/python/leetcodes/src/main/python/com/hit/basmath/interview/top_interview_questions/easy_collection/dynamic_programming/array_and_string/_53.py) |![easy](https://github.com/guobinhit/myleetcode/blob/master/images/easy.png)| Dynamic Programming
+|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/dynamic_programming/_53.java) & [Python](https://github.com/guobinhit/myleetcode/blob/master/codes/python/leetcodes/src/main/python/com/hit/basmath/interview/top_interview_questions/easy_collection/dynamic_programming/_53.py) |![easy](https://github.com/guobinhit/myleetcode/blob/master/images/easy.png)| Dynamic Programming
 |66|[Plus One](https://leetcode.com/problems/plus-one/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/learn/array_and_string/_66.java) & Python|![easy](https://github.com/guobinhit/myleetcode/blob/master/images/easy.png)| Array
 |70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/learn/array_and_string/_70.java) & Python| ![easy](https://github.com/guobinhit/myleetcode/blob/master/images/easy.png)| Dynamic Programming
 |88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/description/)|[Java](https://github.com/guobinhit/myleetcode/blob/master/codes/java/leetcodes/src/main/java/com/hit/basmath/interview/top_interview_questions/easy_collection/sorting_and_searching/_88.java) & Python |![easy](https://github.com/guobinhit/myleetcode/blob/master/images/easy.png)| Sorting and Searching