Formatted question description: https://leetcode.ca/all/2042.html

# 2042. Check if Numbers Are Ascending in a Sentence (Easy)

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:**

Input:s = "1 box has 3 blue 4 red 6 green and 12 yellow marbles"Output:trueExplanation:The numbers in s are: 1, 3, 4, 6, 12. They are strictly increasing from left to right: 1 < 3 < 4 < 6 < 12.

**Example 2:**

Input:s = "hello world 5 x 5"Output:falseExplanation:The numbers in s are:,5. They are not strictly increasing.5

**Example 3:**

Input:s = "sunset is at 7 51 pm overnight lows will be in the low 50 and 60 s"Output:falseExplanation:The numbers in s are: 7,,51, 60. They are not strictly increasing.50

**Example 4:**

Input:s = "4 5 11 26"Output:trueExplanation:The numbers in s are: 4, 5, 11, 26. They are strictly increasing from left to right: 4 < 5 < 11 < 26.

**Constraints:**

`3 <= s.length <= 200`

`s`

consists of lowercase English letters, spaces, and digits from`0`

to`9`

, inclusive.- The number of tokens in
`s`

is between`2`

and`100`

, inclusive. - The tokens in
`s`

are separated by a single space. - There are at least
**two**numbers in`s`

. - Each number in
`s`

is a**positive**number**less**than`100`

, with no leading zeros. `s`

contains no leading or trailing spaces.

**Similar Questions**:

## Solution 1. Brute Force

```
// OJ: https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence//
// Time: O(N)
// Space: O(N)
class Solution {
public:
bool areNumbersAscending(string s) {
string word;
istringstream ss(s);
int prev = -1;
while (ss >> word) {
if (isdigit(word[0])) {
int n = stoi(word);
if (n <= prev) return false;
prev = n;
}
}
return true;
}
};
```

## Discuss

https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/discuss/1525203/C%2B%2B-Brute-Force