Question

How to merge two sorted arrays without duplicates in Kotlin

Answer 1

fun mergeSortedArrays(arr1: IntArray, arr2: IntArray): IntArray {
    val mergedSet = mutableSetOf<Int>()
    var i = 0
    var j = 0

    while (i < arr1.size && j < arr2.size) {
        when {
            arr1[i] < arr2[j] -> {
                mergedSet.add(arr1[i])
                i++
            }
            arr1[i] > arr2[j] -> {
                mergedSet.add(arr2[j])
                j++
            }
            else -> {
                mergedSet.add(arr1[i])
                i++
                j++
            }
        }
    }

    while (i < arr1.size) {
        mergedSet.add(arr1[i])
        i++
    }

    while (j < arr2.size) {
        mergedSet.add(arr2[j])
        j++
    }

    return mergedSet.sorted().toIntArray()
}
     
fun main() {
	val arr1 = intArrayOf(1, 3, 5, 7, 8)
	val arr2 = intArrayOf(2, 3, 6, 8, 9, 10)

	val mergedArray = mergeSortedArrays(arr1, arr2)

	println(mergedArray.joinToString(", "))  
}

   
      
/*
run:

1, 2, 3, 5, 6, 7, 8, 9, 10
  
*/

 

70+ SQL courses for beginners and professionals

Answer 2

fun merge(arr1: List<Int>, arr2: List<Int>): List<Int> {
    // Combine the two lists and remove duplicates using a Set
    val mergedSet = (arr1 + arr2).toSet()

    // Sort the list
    return mergedSet.sorted()
}

fun main() {
    val arr1 = listOf(1, 2, 2, 3, 7, 7, 7, 8, 9)
    val arr2 = listOf(0, 0, 4, 4, 4, 5, 6, 7, 7, 8)

    val mergedArray = merge(arr1, arr2)

    println(mergedArray.joinToString(", "))
}

   
      
/*
run:

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

 

70+ SQL courses for beginners and professionals