Tidy Number Checker

Easy

A tidy number is a number whose digits are in non-decreasing order. Your task is to determine if a given number is a tidy number. For this problem, you will need to define a function isTidy which takes an integer N and returns True if N is a tidy number and False otherwise.

Example 1

Input

[
  123
]

Output

True

Explanation. The digits 1, 2, and 3 are in non-decreasing order.

Example 2

Input

[
  321
]

Output

False

Explanation. The digits 3, 2, 1 are not in non-decreasing order.

Example 3

Input

[
  455
]

Output

True

Explanation. The digits 4, 5, and 5 are in non-decreasing order.

Example 4

Input

[
  -162
]

Output

False

Explanation. Negative number but digits 1, 6, 2 are not in non-decreasing order (ignoring the negative sign).

Example 5

Input

[
  1111
]

Output

True

Explanation. All the digits are the same, thus are in non-decreasing order.

Follow-up: Can you extend this solution to work with numbers represented as strings for extremely large numbers, beyond standard number limits?

Constraints:

1. Numbers will be within the range of a normal 32-bit signed integer.\n2. The number can be positive, negative, or zero.

Views: 11

Tidy Number Checker

Solution

Judge

Tidy Number Checker

Discussion (0)

Solution

Judge