LeetCode Top Interview Questions 334. Increasing Triplet Subsequence (Java版; Medium)

最新推荐文章于 2024-09-15 19:46:31 发布

littlehaes

最新推荐文章于 2024-09-15 19:46:31 发布

阅读量159

点赞数

文章标签： java leetcode 算法

本文链接：https://blog.csdn.net/littlehaes/article/details/104105918

版权

LeetCode Top Interview Questions 专栏收录该内容

76 篇文章 0 订阅

订阅专栏

welcome to my blog

LeetCode Top Interview Questions 334. Increasing Triplet Subsequence (Java版; Medium)

题目描述

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

Formally the function should:

Return true if there exists i, j, k 
such that arr[i] < arr[j] < arr[k] given 0 ≤ i < j < k ≤ n-1 else return false.
Note: Your algorithm should run in O(n) time complexity and O(1) space complexity.

Example 1:

Input: [1,2,3,4,5]
Output: true
Example 2:

Input: [5,4,3,2,1]
Output: false

第一次做; 参考题解, 核心: 找到最小的, 次小的, 次次小的

//找到最小的, 次小的, 次次小的
class Solution {
    public boolean increasingTriplet(int[] nums) {
        int small=Integer.MAX_VALUE, medium=Integer.MAX_VALUE;
        for(int i=0; i<nums.length; i++){
            int cur = nums[i];
            // cur <= small
            if(cur <= small)
                small = cur;
            // small < cur <= medium
            else if(cur<=medium)
                medium = cur;
            // cur > medium
            else 
                return true;
        }
        return false;
    }
}