LeetCode 53. Maximum Subarray - in Python

This is a solution to the LeetCode problem 53. Maximum Subarray, following directly from Kadane's Algorithms, and it was able to beat over 90% of other users in runtime. Thank you.