From eddfde7c1cb4c7db4c11f7d6c76b8a732a65d313 Mon Sep 17 00:00:00 2001
From: ZongqinWang <1722249371@qq.com>
Date: Wed, 15 Jun 2022 22:25:35 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200056.=E5=90=88?=
=?UTF-8?q?=E5=B9=B6=E5=8C=BA=E9=97=B4.md=20Scala=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
---
problems/0056.合并区间.md | 30 ++++++++++++++++++++++++++++++
1 file changed, 30 insertions(+)
diff --git a/problems/0056.合并区间.md b/problems/0056.合并区间.md
index e444a221..38e3472c 100644
--- a/problems/0056.合并区间.md
+++ b/problems/0056.合并区间.md
@@ -286,7 +286,37 @@ function merge(intervals: number[][]): number[][] {
};
```
+### Scala
+```scala
+object Solution {
+ import scala.collection.mutable
+ def merge(intervals: Array[Array[Int]]): Array[Array[Int]] = {
+ var res = mutable.ArrayBuffer[Array[Int]]()
+
+ // 排序
+ var interval = intervals.sortWith((a, b) => {
+ a(0) < b(0)
+ })
+
+ var left = interval(0)(0)
+ var right = interval(0)(1)
+
+ for (i <- 1 until interval.length) {
+ if (interval(i)(0) <= right) {
+ left = math.min(left, interval(i)(0))
+ right = math.max(right, interval(i)(1))
+ } else {
+ res.append(Array[Int](left, right))
+ left = interval(i)(0)
+ right = interval(i)(1)
+ }
+ }
+ res.append(Array[Int](left, right))
+ res.toArray // 返回res的Array形式
+ }
+}
+```
-----------------------
From 23c26135135f39757932a158d5c4b9f00f4bfe3b Mon Sep 17 00:00:00 2001
From: ZongqinWang <1722249371@qq.com>
Date: Wed, 15 Jun 2022 23:15:29 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200738.=E5=8D=95?=
=?UTF-8?q?=E8=B0=83=E9=80=92=E5=A2=9E=E7=9A=84=E6=95=B0=E5=AD=97.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/0738.单调递增的数字.md | 30 ++++++++++++++++++++++++++
1 file changed, 30 insertions(+)
diff --git a/problems/0738.单调递增的数字.md b/problems/0738.单调递增的数字.md
index 4e4079a7..2911e1cc 100644
--- a/problems/0738.单调递增的数字.md
+++ b/problems/0738.单调递增的数字.md
@@ -246,7 +246,37 @@ function monotoneIncreasingDigits(n: number): number {
```
+### Scala
+直接转换为了整数数组:
+```scala
+object Solution {
+ import scala.collection.mutable
+ def monotoneIncreasingDigits(n: Int): Int = {
+ var digits = mutable.ArrayBuffer[Int]()
+ // 提取每位数字
+ var temp = n // 因为 参数n 是不可变量所以需要赋值给一个可变量
+ while (temp != 0) {
+ digits.append(temp % 10)
+ temp = temp / 10
+ }
+ // 贪心
+ var flag = -1
+ for (i <- 0 until (digits.length - 1) if digits(i) < digits(i + 1)) {
+ flag = i
+ digits(i + 1) -= 1
+ }
+ for (i <- 0 to flag) digits(i) = 9
+
+ // 拼接
+ var res = 0
+ for (i <- 0 until digits.length) {
+ res += digits(i) * math.pow(10, i).toInt
+ }
+ res
+ }
+}
+```
-----------------------
