kamov/advent-of-code
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

Update 1.scala

Browse source
This commit is contained in:
kamoshi 2019-11-27 02:36:20 +01:00 committed by GitHub
parent b6da8346a1
commit d1dca5328f
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
2018/Scala/1.scala
View file

@ -9,8 +9,6 @@ val result1 = lines.foldLeft (0) { (acc, i) => acc + Integer.parseInt(i) }
println(result1)
// Solution 2
val hash = new mutable.HashSet[Int]()
def toLazyLoop[A](list: List[A]): LazyList[A] = {
def toLazy[A](list: List[A]): LazyList[A] = {
list match {
@ -21,11 +19,12 @@ def toLazyLoop[A](list: List[A]): LazyList[A] = {
toLazy(list) #::: toLazyLoop(list)
}
def findFirstRepeat[A](lazylist:LazyList[String], acc:Int, hash:mutable.HashSet[Int]):Int =
val hash = new mutable.HashSet[Int]()
def findFirstRepeat[A](lazylist:LazyList[String], acc:Int):Int =
if (!hash.add(acc)) acc
else lazylist match {
case hd #:: tl => findFirstRepeat(tl, (acc + hd.toInt), hash)
case hd #:: tl => findFirstRepeat(tl, (acc + hd.toInt))
}
val result2 = findFirstRepeat(toLazyLoop(lines), 0, hash)
val result2 = findFirstRepeat(toLazyLoop(lines), 0)
println("First repeat frequency: " + result2)