From 871d96a2f9202504f2f5c754da7404f602a9f073 Mon Sep 17 00:00:00 2001
From: ZongqinWang <1722249371@qq.com>
Date: Wed, 11 May 2022 16:48:59 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200209.=E9=95=BF=E5=BA=A6?=
 =?UTF-8?q?=E6=9C=80=E5=B0=8F=E7=9A=84=E5=AD=90=E6=95=B0=E7=BB=84.md=20Sca?=
 =?UTF-8?q?la=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0209.长度最小的子数组.md | 48 +++++++++++++++++++++++
 1 file changed, 48 insertions(+)

diff --git a/problems/0209.长度最小的子数组.md b/problems/0209.长度最小的子数组.md
index fd72cf1b..78b8156c 100644
--- a/problems/0209.长度最小的子数组.md
+++ b/problems/0209.长度最小的子数组.md
@@ -400,6 +400,54 @@ class Solution {
     }
 }
 ```
+Scala:
+
+滑动窗口:
+```scala
+object Solution {
+  def minSubArrayLen(target: Int, nums: Array[Int]): Int = {
+    var result = Int.MaxValue // 返回结果，默认最大值
+    var left = 0 // 慢指针，当sum>=target，向右移动
+    var sum = 0 // 窗口值的总和
+    for (right <- 0 until nums.length) {
+      sum += nums(right)
+      while (sum >= target) {
+        result = math.min(result, right - left + 1) // 产生新结果
+        sum -= nums(left) // 左指针移动，窗口总和减去左指针的值
+        left += 1 // 左指针向右移动
+      }
+    }
+    // 相当于三元运算符，return关键字可以省略
+    if (result == Int.MaxValue) 0 else result
+  }
+}
+```
+
+暴力解法:
+```scala
+object Solution {
+  def minSubArrayLen(target: Int, nums: Array[Int]): Int = {
+    import scala.util.control.Breaks
+    var res = Int.MaxValue
+    var subLength = 0
+    for (i <- 0 until nums.length) {
+      var sum = 0
+      Breaks.breakable(
+        for (j <- i until nums.length) {
+          sum += nums(j)
+          if (sum >= target) {
+            subLength = j - i + 1
+            res = math.min(subLength, res)
+            Breaks.break()
+          }
+        }
+      )
+    }
+    // 相当于三元运算符
+    if (res == Int.MaxValue) 0 else res
+  }
+}
+```
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>