菜鸟的每日力扣系列——用贪心简化“最长上升子序列”问题

from typing import List

def increasing_triplet(nums: List[int]):
    min_num, sec_num = float('inf'), float('inf')
    for i in nums:
        min_num = min(i, min_num)
        if i > min_num:
            sec_num = min(i, sec_num)
        if i > sec_num:
            return True
    return False

nums = [5, 4, 3, 2, 1]
print(increasing_triplet(nums))  
# False

from typing import List

def dominant_index(nums: List[int]):
    max_num = sec_num = index = -1
    for i, num in enumerate(nums):
        if num > max_num:
            sec_num, max_num, index = max_num, num, i
        elif num > sec_num:
            sec_num = num
        print("num_ele=", sec_num, "num_res=", max_num)
    return index if max_num >= 2 * sec_num else -1

nums = [3, 6, 1, 0]
print(dominant_index(nums))  # 1