• 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.s3350_adjacent_increasing_subarrays_detection_ii.Solution.kt Maven / Gradle / Ivy

package g3301_3400.s3350_adjacent_increasing_subarrays_detection_ii

// #Medium #Array #Binary_Search #2024_11_15_Time_947_ms_(48.57%)_Space_87.4_MB_(51.43%)

import kotlin.math.max
import kotlin.math.min

class Solution {
    fun maxIncreasingSubarrays(nums: List): Int {
        val n = nums.size
        val a = IntArray(n)
        for (i in 0..