Idea: Find peak and bottom

For every [bottom, peak], find if there is one number `bottom<number<peak`

.

```
public class Solution {
public boolean find132pattern(int[] nums) {
if(nums.length<3) return false;
Integer low = null, high = null;
int start = 0, end = 0;
while(start<nums.length-1){
while(start<nums.length-1 && nums[start]>=nums[start+1]) start++;
// start is lowest now
int m = start+1;
while(m<nums.length-1 && nums[m]<=nums[m+1]) m++;
// m is highest now
int j = m+1;
while(j<nums.length){
if(nums[j]>nums[start] && nums[j]<nums[m]) return true;
j++;
}
start = m+1;
}
return false;
}
}
```