Check if Numbers Are Ascending in a Sentence LeetCode solution in Java

1
// Space Complexity: O(1)
2
// Time Complexity: O(n)
3
class Solution {
4
  public boolean areNumbersAscending(String s) {
5
    int prev = 0;
6

7
    for (String token : s.split(" ")) {
8
      try {
9
        int number = Integer.parseInt(token);
10
        if (number <= prev) return false;
11
        prev = number;
12
      } catch (Exception e) {
13
      }
14
    }
15

16
    return true;
17
  }
18
}