Given an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j] and nums[k] such that i < j < k and nums[i] < nums[k] < nums[j].
Return true if there is a 132 pattern in nums, otherwise, return false.
The "132" name comes from the value ordering: the 1st element is smallest, the 3rd element (middle index) is largest, and the 2nd element (last index) is in between.
n == nums.length1 <= n <= 2 * 10^5-10^9 <= nums[i] <= 10^9nums = [1,2,3,4]falsenums = [3,1,4,2]truenums = [-1,3,2,0]true