Leetcode/1909.py at master · subashkj005/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
# def check_increa(nums):
#     i = 0
#     diff = float('-inf')
#     x = True
#
#     while x:
#         if nums[i] < diff :
#             nums.remove(diff)
#             x = False
#         elif nums[i]> diff or nums[i] == diff:
#             diff = nums[i]
#             i += 1
#             if i == len(nums):
#                 x = False
#
#     while i < len(nums):
#         if nums[i] < diff or nums[i] == diff:
#             return False
#         else:
#             diff = nums[i]
#             i += 1
#
#     return True
#
#
# nums = [1, 1, 1]
# print(check_increa(nums))


# def check_increa(nums):
#     i = 0
#     diff = float('-inf')
#     x = True
#
#     while i < len(nums) and x:
#         if nums[i] < diff:
#             nums.remove(diff)
#             x = False
#         else:
#             diff = nums[i]
#             i += 1
#
#     while i < len(nums):
#         if nums[i] <= diff:
#             return False
#         diff = nums[i]
#         i += 1
#
#     return True
#
#
# nums = [1, 1, 1, 2]
# print(check_increa(nums))


def check_increa(nums):
    i = 0
    diff = float('-inf')
    x = True

    while x:
        if nums[i] < diff:
            nums.remove(diff)
            x = False
        elif nums[i] >= diff:
            diff = nums[i]
            i += 1
            if i == len(nums):
                x = False

    if i < len(nums) and (nums[i] <= diff or (i > 1 and nums[i] <= nums[i - 2])):
        return False

    return True


nums = [1, 1, 1]
print(check_increa(nums))