LeetCode-in-Java

2375. Construct Smallest Number From DI String

Medium

You are given a 0-indexed string pattern of length n consisting of the characters 'I' meaning increasing and 'D' meaning decreasing.

A 0-indexed string num of length n + 1 is created using the following conditions:

• num consists of the digits '1' to '9', where each digit is used at most once.
• If pattern[i] == 'I', then num[i] < num[i + 1].
• If pattern[i] == 'D', then num[i] > num[i + 1].

Return the lexicographically smallest possible string num that meets the conditions.

Example 1:

Input: pattern = “IIIDIDDD”

Output: “123549876”

Explanation:

At indices 0, 1, 2, and 4 we must have that num[i] < num[i+1].

At indices 3, 5, 6, and 7 we must have that num[i] > num[i+1].

Some possible values of num are “245639871”, “135749862”, and “123849765”.

It can be proven that “123549876” is the smallest possible num that meets the conditions.

Note that “123414321” is not possible because the digit ‘1’ is used more than once.

Example 2:

Input: pattern = “DDD”

Output: “4321”

Explanation:

Some possible values of num are “9876”, “7321”, and “8742”.

It can be proven that “4321” is the smallest possible num that meets the conditions.

Constraints:

• 1 <= pattern.length <= 8
• pattern consists of only the letters 'I' and 'D'.

Solution

public class Solution {
    public String smallestNumber(String pattern) {
        int[] ret = new int[pattern.length() + 1];
        ret[0] = 1;
        int max = 2;
        int lastI = 0;
        for (int i = 0; i < pattern.length(); i++) {
            if (pattern.charAt(i) == 'I') {
                ret[i + 1] = max++;
                lastI = i + 1;
            } else {
                for (int j = i; j >= lastI; j--) {
                    ret[j + 1] = ret[j];
                }
                ret[lastI] = max++;
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i : ret) {
            sb.append(i);
        }
        return sb.toString();
    }
}

This site is open source. Improve this page.