2970. 统计移除递增子数组的数目 I

统计移除递增子数组的数目 I

• 难度: easy
• 原始链接: https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-i
• 标签: 双指针

解法一: 双指针

go

func incremovableSubarrayCount(nums []int) int {
  n := len(nums)
  ans := 0
  for i := 0; i < n; i++ {
    for j := i; j < n; j++ {
      isSucess := true
      preNum := -1
      for k := 0; k < i; k++ {
        if nums[k] <= preNum {
          isSucess = false
          break
        }
        preNum = nums[k]
      }
      for k := j + 1; k < n; k++ {
        if nums[k] <= preNum {
          isSucess = false
          break
        }
        preNum = nums[k]
      }
      if isSucess {
        ans++
      }
    }
  }
  return ans
}