leetcode Increasing Triplet Subsequence
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.Your algorithm should run in O(n) time complexity and O(1) space complexity.
Examples:
Given [1, 2, 3, 4, 5]
,
return true
.
Given [5, 4, 3, 2, 1]
,
return false
.
题意:给定一个长度为n的乱序的数组arr,让你求是否有i,j,k三个数,使得 arr[i] < arr[j] < arr[k] ( 0 ≤ i < j < k ≤ n-1)
详见原文:https://www.hrwhisper.me/leetcode-increasing-triplet-subsequence/
更多题解可以查看:https://www.hrwhisper.me/leetcode-algorithm-solution/
class Solution(object):
def increasingTriplet(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
x1 = x2 = 0x7fffffff
for num in nums:
if num <= x1:
x1 = num
elif num <= x2: # x1 < num <= x2
x2 = num
else: # x1 < x2 < num , so num is x3
return True
return False
出处:细语呢喃 > leetcode Increasing Triplet Subsequence
地址:https://www.hrwhisper.me/leetcode-increasing-triplet-subsequence/