[LeetCode]334. Increasing Triplet Subsequence

https://leetcode.com/problems/increasing-triplet-subsequence/?tab=Description

找到数组中是否存在i < j < k && nums[i] < nums[j] < nums[k]

very straight，从low 到 high update

public class Solution { public boolean increasingTriplet(int[] nums) { int low = Integer.MAX_VALUE; int high = Integer.MAX_VALUE; for (int n : nums) { if (n <= low) { low = n; } else if (n <= high) { high = n; } else { return true; } } return false; } }