Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,870 questions

51,793 answers

573 users

How to merge two sorted arrays without duplicates in Scala

1 Answer

0 votes
def merge(arr1: Array[Int], arr2: Array[Int]): Array[Int] = {
  val mergedSet = (arr1 ++ arr2).toSet
  
  mergedSet.toArray
}

val arr1 = Array(1, 2, 2, 3, 7, 7, 7, 8, 9)
val arr2 = Array(0, 0, 4, 4, 4, 5, 6, 7, 7, 8)

val mergedArray = merge(arr1, arr2)

val sortedArray = mergedArray.sorted

println(sortedArray.mkString(", "))



/*
run:

0, 1, 2, 3, 4, 5, 6, 7, 8, 9

*/

 



answered Oct 10, 2024 by avibootz

Related questions

2 answers 139 views
2 answers 102 views
1 answer 183 views
1 answer 116 views
1 answer 157 views
1 answer 168 views
1 answer 187 views
...