-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathareNumbersAscending.py
More file actions
32 lines (26 loc) · 1.15 KB
/
areNumbersAscending.py
File metadata and controls
32 lines (26 loc) · 1.15 KB
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
"""
A sentence is a list of tokens separated by a single space with no leading or trailing spaces. Every token is either a
positive number consisting of digits 0-9 with no leading zeros, or a word consisting of lowercase English letters.
For example, "a puppy has 2 eyes 4 legs" is a sentence with seven tokens: "2" and "4" are numbers and the other tokens
such as "puppy" are words.
Given a string s representing a sentence, you need to check if all the numbers in s are strictly increasing from left
to right (i.e., other than the last number, each number is strictly smaller than the number on its right in s).
Return true if so, or false otherwise.
Example 1:
example-1
Input: s = "1 box has 3 blue 4 red 6 green and 12 yellow marbles"
Output: true
Explanation: The numbers in s are: 1, 3, 4, 6, 12.
They are strictly increasing from left to right: 1 < 3 < 4 < 6 < 12.
"""
class Solution:
def areNumbersAscending(self, s: str) -> bool:
s = s.split(" ")
val = 0
for i in s:
if i.isdigit():
if int(i) > val:
val = int(i)
else:
return False
return True