Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit d79fdc8

Browse files
Merge branch 'master' of github.com:andersonkmi/leetcode-scala
2 parents 4761dd2 + 3ff2319 commit d79fdc8

File tree

3 files changed

+21
-1
lines changed

3 files changed

+21
-1
lines changed

‎src/main/scala/org/codecraftlabs/leetcode/JewelsAndStones.scala

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ object JewelsAndStones {
55
val jewels = j.toSet
66
val stones = s.toList
77

8-
val groupedStones = stones.groupBy(identity).mapValues(_.length)
8+
val groupedStones = stones.groupBy(identity).view.mapValues(_.length)
99
groupedStones.filterKeys(jewels).values.sum
1010
}
1111
}
Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
package org.codecraftlabs.leetcode
2+
3+
object MissingNumbers {
4+
def missingNumbers(arr: Array[Int], brr: Array[Int]): Array[Int] = {
5+
brr.diff(arr).distinct.sorted
6+
}
7+
8+
}
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
package org.codecraftlabs.leetcode
2+
3+
import org.scalatest.{FlatSpec, Matchers}
4+
5+
class MissingNumbersSpec extends FlatSpec with Matchers {
6+
"[7, 2, 5, 3, 5, 3] and [7, 2, 5, 4, 6, 3, 5, 3]" should "be [4, 6]" in {
7+
val array1 = Array(7, 2, 5, 3, 5, 3)
8+
val array2 = Array(7, 2, 5, 4, 6, 3, 5, 3)
9+
10+
MissingNumbers.missingNumbers(array1, array2) should contain allOf(4, 6)
11+
}
12+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /