JuniorArray
Trionic Array I
You are given an integer array nums of length n.
An array is trionic if there exist indices 0 < p < q < n - 1 such that:
nums[0...p]is strictly increasing,nums[p...q]is strictly decreasing,nums[q...n - 1]is strictly increasing.
Return true if nums is trionic, otherwise return false.
Example 1
Input
nums = [1,3,5,4,2,6]Output
truePick
p = 2 and q = 4, making [1, 3, 5] strictly increasing, [5, 4, 2] strictly decreasing, and [2, 6] strictly increasing.Example 2
Input
nums = [2,1,3]Output
falseThere is no way to pick
p and q to form the required three segments.Constraints
- 3 <= n <= 100
- -1000 <= nums[i] <= 1000