I don't understand how
val xs1 = Set(3, 2, 1, 4, 5, 6, 7)
val ys1 = Set(7, 2, 1, 4, 5, 6, 3)
xs1.iterator.sameElements(ys1.iterator) should be (true)but
val xt1 = Set(1, 2, 3)
val yt1 = Set(3, 2, 1)
xt1.iterator.sameElements(yt1.iterator) should be (false)Both are in the wrong order ??
I don't understand how
val xs1 = Set(3, 2, 1, 4, 5, 6, 7) val ys1 = Set(7, 2, 1, 4, 5, 6, 3) xs1.iterator.sameElements(ys1.iterator) should be (true)but
val xt1 = Set(1, 2, 3) val yt1 = Set(3, 2, 1) xt1.iterator.sameElements(yt1.iterator) should be (false)Both are in the wrong order ??
xs1 and ys1 are both HashSet with same order , but xt1 and yt1 are just Set with different order.
I don't understand how
val xs1 = Set(3, 2, 1, 4, 5, 6, 7) val ys1 = Set(7, 2, 1, 4, 5, 6, 3) xs1.iterator.sameElements(ys1.iterator) should be (true)but
val xt1 = Set(1, 2, 3) val yt1 = Set(3, 2, 1) xt1.iterator.sameElements(yt1.iterator) should be (false)Both are in the wrong order ??
xs1 and ys1 are both HashSet with same order , but xt1 and yt1 are just Set with different order.
When the length of a Set is bigger than 4, this Set automatically is converted into a HashSet
Hi guys.. I am looking for a solution in Scala for the below problem... I am thinking more from functional perspective..
A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N.
For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation 10100 and contains one binary gap of length 1. The number 15 has binary representation 1111 and has no binary gaps. The number 32 has binary representation 100000 and has no binary gaps.
Write a function:
class Solution { public int solution(int N); }
that, given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn't contain a binary gap.
For example, given N = 1041 the function should return 5, because N has binary representation 10000010001 and so its longest binary gap is of length 5. Given N = 32 the function should return 0, because N has binary representation '100000' and thus no binary gaps.
Write an efficient algorithm for the following assumptions:
N is an integer within the range [1..2,147,483,647].
ef makeUpper(xs: List[String]) = xs map {
_.toUpperCase
}
def makeWhatEverYouLike(xs: List[String], sideEffect: String => String) =
xs map sideEffect
makeUpper(List("abc", "xyz", "123")) should be(
List(ABC, XYZ, 123): List[String]
)
makeWhatEverYouLike(List("ABC", "XYZ", "123"), { x =>
x.toLowerCase
}) should be(
List(abc, xyz, 123): List[String]
)
//using it inline
val myName = (name: String) => s"My name is $name"
makeWhatEverYouLike(List("John", "Mark"), myName) should be(
List(My name is John, My name is Mark): List[String]
)
List("Scala", "Erlang", "Clojure") map (_.length) should be(
List(5, 6, 7): List[Int]
)
Evaluation failed : Compilation Error ; ERROR -> postfix operator Mark needs to be enabled by making the implicit value scala.language.postfixOps visible. at [419, 419, 419]
9 contributors kiroco12 juanpedromoreno Yaskier raulraja hellrich josephpconley rzats laverboy andyscottEdit exercises
Scala Exercises is an Open Source project by 47 Degrees
Contributing · License
!/bin/sh
exec scala -nc -howtorun:script "$0" "$@"
!#
object HelloWorld {
def main(args: Array[String]) {
println("Hello, World! " + args.toList)
}
}
tyoung3@taos:scala$ time ./hw.sh
Hello, World! List()
real 0m4.035s
user 0m15.127s
sys 0m0.302s
code or state" message. Is there a way to get this running? Did I install everything correctly? Thanks!