Check if Numbers Are Ascending in a Sentence

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.

LeetCode Problem - 2042

class Solution {
    public boolean areNumbersAscending(String s) {
        // Split the input string into an array of words/numbers
        String[] numbers = s.split(" ");

        int prev = 0; // Variable to track the previous number
        int curr = 0; // Variable to track the current number
        int count = 0; // Counter to check if we've found any valid number

        // Loop through each word in the numbers array
        for(int i = 0; i < numbers.length; i++) {
            try {
                // Try to parse the current word into an integer
                curr = Integer.parseInt(numbers[i]);

                // If this is the first valid number found
                if(count == 0) {
                    prev = curr; // Set prev to curr
                    count++; // Increment count to indicate we found a number
                } 
                // If the current number is greater than the previous number
                else if(curr > prev) {
                    prev = curr; // Update prev to the current number
                } 
                // If the current number is not greater than the previous number, return false
                else return false;

            } catch (Exception e) {
                // If an exception occurs (e.g., if the word is not a number), continue to the next word
                continue;
            }
        }
        // If all numbers are in ascending order, return true
        return true;
    }
}