g1201_1300.s1291_sequential_digits.Solution.kt Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.30

package g1201_1300.s1291_sequential_digits

// #Medium #Enumeration #Udemy_Arrays #2023_06_08_Time_114_ms_(100.00%)_Space_32.9_MB_(100.00%)

class Solution {
    fun sequentialDigits(low: Int, high: Int): List {
        val arr = intArrayOf(
            12, 23, 34, 45, 56, 67, 78, 89, 123, 234, 345, 456, 567, 678, 789, 1234, 2345, 3456,
            4567, 5678, 6789, 12345, 23456, 34567, 45678, 56789, 123456, 234567, 345678, 456789,
            1234567, 2345678, 3456789, 12345678, 23456789, 123456789
        )
        val result: MutableList = ArrayList()
        for (j in arr) {
            // 234    148         234        256
            if (j in low..high) {
                result.add(j)
            }
        }
        return result
    }
}