Skip to content
Branch: master
Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
..
Failed to load latest commit information.
README.md
monotone_increasing_digits.go
monotone_increasing_digits_test.go

README.md

< Previous                  Next >

738. Monotone Increasing Digits (Medium)

Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.

(Recall that an integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.)

Example 1:

Input: N = 10
Output: 9

Example 2:

Input: N = 1234
Output: 1234

Example 3:

Input: N = 332
Output: 299

Note: N is an integer in the range [0, 10^9].

Related Topics

[Greedy]

Similar Questions

  1. Remove K Digits (Medium)

Hints

Hint 1 Build the answer digit by digit, adding the largest possible one that would make the number still less than or equal to N.
You can’t perform that action at this time.