@@ -0,0 +1,692 @@
+public class Solution %7B%0A%0A  public boolean find132pattern(int%5B%5D nums) %7B%0A    // Keep track of the global minimum.%0A    // The global min will be the ai value.%0A    int min = Integer.MAX_VALUE;%0A    for (int j = 0; j %3C nums.length; j++) %7B%0A      min = Math.min(nums%5Bj%5D, min);%0A%0A      // If the current value is the minimum, %0A      // then this is the ai value for this current iteration.%0A      if (min == nums%5Bj%5D) continue;%0A%0A      // Otherwise, it is not the minimum so let nums%5Bj%5D be aj%0A      for (int k = nums.length - 1; k %3E j; k--) %7B%0A%0A        // If there is a valid ak, after j then return true;%0A        if (min %3C nums%5Bk%5D && nums%5Bk%5D %3C nums%5Bj%5D) return true;%0A      %7D%0A    %7D%0A%0A    return false;%0A  %7D%0A%7D%0A

Add leetcode 456