diff --git a/problems/0053.最大子序和.md b/problems/0053.最大子序和.md
index 73cac244..4971133f 100644
--- a/problems/0053.最大子序和.md
+++ b/problems/0053.最大子序和.md
@@ -333,8 +333,41 @@ function maxSubArray(nums: number[]): number {
 };
 ```
 
+### Scala
 
+**贪心**
 
+```scala
+object Solution {
+  def maxSubArray(nums: Array[Int]): Int = {
+    var result = Int.MinValue
+    var count = 0
+    for (i <- nums.indices) {
+      count += nums(i) // count累加
+      if (count > result) result = count // 记录最大值
+      if (count <= 0) count = 0 // 一旦count为负，则count归0
+    }
+    result
+  }
+}
+```
+
+**动态规划**
+
+```scala
+object Solution {
+  def maxSubArray(nums: Array[Int]): Int = {
+    var dp = new Array[Int](nums.length)
+    var result = nums(0)
+    dp(0) = nums(0)
+    for (i <- 1 until nums.length) {
+      dp(i) = math.max(nums(i), dp(i - 1) + nums(i))
+      result = math.max(result, dp(i))  // 更新最大值
+    }
+    result
+  }
+}
+```
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>