Leetcode 53. Maximum Subarray - Dynamic Programming or Kadane's algorithm

A dynamic programming solution (or Kadane's algorithm ) for Leetcode 53. Maximum Subarray. We define dp[i] as the largest possible subarray sum for arrays ending at index i, then the recursion relation is easily observed. We write the solution both in a vanilla DP format or in a Kadane's algorithm format.