• Home
• com.github.javadev
• leetcode-in-kotlin
• 1.31
• source code
• Solution.kt

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g3301_3400.s3349_adjacent_increasing_subarrays_detection_i.Solution.kt Maven / Gradle / Ivy

package g3301_3400.s3349_adjacent_increasing_subarrays_detection_i

// #Easy #Array #2024_11_15_Time_179_ms_(97.92%)_Space_37.3_MB_(91.67%)

class Solution {
    fun hasIncreasingSubarrays(nums: List, k: Int): Boolean {
        val l = nums.size
        if (l < k * 2) {
            return false
        }
        for (i in 0..): Boolean {
        for (i in p..
= nums[i + 1]) {
                return false
            }
        }
        return true
    }
}