LeetCode334. 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.

解：取first，second来记录选中的值，不断的循环替换。

#这个初始值要够大，犯了这个错误- -
first = 9999999
second = 99999999343434
for i in range(0,len(nums)):
    if first >= nums[i]:
        first = nums[i]
    elif second >= nums[i]:
        second = nums[i]
    else:
        return True
return False

上面的first并不一定记录的是最小值，（second一定记录的是第二大的值）比如5 4 6 1 0 7，则最后输出时
first = 0
second = 6
所以要打出这3个值的话，上面的方法并不能直接打出来，但判断存在与否已经足够了