# LeetCode53 Maximum Subarray Element

## 描述

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.