334.递增的三元子序列(前缀后缀)

链接334. 递增的三元子序列 - 力扣LeetCode题解class Solution { public: bool increasingTriplet(vectorint nums) { int len nums.size(); if (len 0) { return false; } vectorint right(len1, INT_MIN); for (int i len-1; i 0; --i) { right[i] max(nums[i], right[i1]); } vectorint left(len1, INT_MAX); for (int i 0; i len; i) { left[i1] min(nums[i], left[i]); } for (int i 0; i len; i) { if (left[i] nums[i] nums[i] right[i1]) { return true; } } return false; } };