Kotlin中比较两个字节数组获取大小数组的更简便实现方法

Great question! Your current implementation uses a clever functional approach with zip and dropWhile, but there are a couple of more concise (and potentially more efficient) ways to handle this byte array comparison in Kotlin.

1. Leverage Java's Arrays.compare (Simplest Option) #

Since Kotlin seamlessly interoperates with Java, you can use the built-in Arrays.compare method which already implements the exact lexicographical byte-by-byte comparison logic you need. This avoids reinventing the wheel and keeps your code extremely clean:

import java.util.Arrays

val array1 = byteArrayOf(1, 2, 4)
val array2 = byteArrayOf(1, 2, 3)

val (smaller, bigger) = when (Arrays.compare(array1, array2)) {
    in Int.MIN_VALUE..-1 -> array1 to array2
    in 1..Int.MAX_VALUE -> array2 to array1
    else -> array1 to array2 // Handles equal arrays case
}

This method is not only concise but also optimized under the hood, making it great for most use cases. Note that Arrays.compare follows standard lexicographical rules: if all compared bytes are equal, the shorter array is considered smaller. If you want to match your original code's behavior (return array1 to array2 even when one is a prefix of the other), you can keep the else clause as-is.

2. Pure Kotlin Iterative Approach (More Control) #

If you prefer a pure Kotlin implementation without relying on Java libraries, a simple loop can be more efficient than the zip approach (since it avoids creating intermediate Pair objects):

val array1 = byteArrayOf(1, 2, 4)
val array2 = byteArrayOf(1, 2, 3)

val (smaller, bigger) = run {
    val minLength = minOf(array1.size, array2.size)
    for (i in 0 until minLength) {
        val b1 = array1[i]
        val b2 = array2[i]
        if (b1 != b2) {
            return@run if (b1 < b2) array1 to array2 else array2 to array1
        }
    }
    // All compared bytes are equal - match original code's behavior
    array1 to array2
    // Uncomment below for standard lexicographical behavior (shorter array is smaller)
    // if (array1.size < array2.size) array1 to array2 else array2 to array1
}

This approach gives you full control over how to handle the case where one array is a prefix of the other, and it's more memory-efficient for large arrays.

A Quick Note on Your Original Code #

Your functional approach is elegant, but keep in mind that zip will create a list of Pair<Byte, Byte> objects for every byte up to the shorter array's length. For very large arrays, this could introduce unnecessary memory overhead compared to the iterative or Arrays.compare methods.

内容的提问来源于stack exchange，提问作者Freewind