LeetCode Daily Problem P2048 Next Greater Numerically Balanced Number

---

Timeline

Timeline

2025-10-20

init

Precomputation

---

Problem:

P2048 Next Greater Numerically Balanced Number

https://leetcode.cn/problems/next-greater-numerically-balanced-number/description/

For this type of problem where all possible solutions are sparse, just precompute a table, and both time and space complexity are$O(1)$

struct Solution;
use std::collections::HashMap;
use std::sync::LazyLock;

static RESULT: LazyLock<Vec<i32>> = LazyLock::new(|| {
    let vec = vec![
        1, 22, 122, 212, 221, 333, 1333, 3133, 3313, 3331, 4444, 14444, 22333, 23233, 23323, 23332,
        32233, 32323, 32332, 33223, 33232, 33322, 41444, 44144, 44414, 44441, 55555, 122333,
        123233, 123323, 123332, 132233, 132323, 132332, 133223, 133232, 133322, 155555, 212333,
        213233, 213323, 213332, 221333, 223133, 223313, 223331, 224444, 231233, 231323, 231332,
        232133, 232313, 232331, 233123, 233132, 233213, 233231, 233312, 233321, 242444, 244244,
        244424, 244442, 312233, 312323, 312332, 313223, 313232, 313322, 321233, 321323, 321332,
        322133, 322313, 322331, 323123, 323132, 323213, 323231, 323312, 323321, 331223, 331232,
        331322, 332123, 332132, 332213, 332231, 332312, 332321, 333122, 333212, 333221, 422444,
        424244, 424424, 424442, 442244, 442424, 442442, 444224, 444242, 444422, 515555, 551555,
        555155, 555515, 555551, 666666, 1224444, 1242444, 1244244, 1244424, 1244442, 1422444,
        1424244, 1424424, 1424442, 1442244, 1442424, 1442442, 1444224, 1444242, 1444422, 1666666,
        2124444, 2142444, 2144244, 2144424, 2144442, 2214444, 2241444, 2244144, 2244414, 2244441,
        2255555, 2412444, 2414244, 2414424, 2414442, 2421444, 2424144, 2424414, 2424441, 2441244,
        2441424, 2441442, 2442144, 2442414, 2442441, 2444124, 2444142, 2444214, 2444241, 2444412,
        2444421, 2525555, 2552555, 2555255, 2555525, 2555552, 3334444, 3343444, 3344344, 3344434,
        3344443, 3433444, 3434344, 3434434, 3434443, 3443344, 3443434, 3443443, 3444334, 3444343,
        3444433, 4122444, 4124244, 4124424, 4124442, 4142244, 4142424, 4142442, 4144224, 4144242,
        4144422, 4212444, 4214244, 4214424, 4214442, 4221444, 4224144, 4224414, 4224441, 4241244,
        4241424, 4241442, 4242144, 4242414, 4242441, 4244124, 4244142, 4244214, 4244241, 4244412,
        4244421, 4333444, 4334344, 4334434, 4334443, 4343344, 4343434, 4343443, 4344334, 4344343,
        4344433, 4412244, 4412424, 4412442, 4414224, 4414242, 4414422, 4421244, 4421424, 4421442,
        4422144, 4422414, 4422441, 4424124, 4424142, 4424214, 4424241, 4424412, 4424421, 4433344,
        4433434, 4433443, 4434334, 4434343, 4434433, 4441224, 4441242, 4441422, 4442124, 4442142,
        4442214, 4442241, 4442412, 4442421, 4443334, 4443343, 4443433, 4444122, 4444212, 4444221,
        4444333, 5225555, 5252555, 5255255, 5255525, 5255552, 5522555, 5525255, 5525525, 5525552,
        5552255, 5552525, 5552552, 5555225, 5555252, 5555522, 6166666, 6616666, 6661666, 6666166,
        6666616, 6666661, 7777777,
    ];
    vec
});

impl Solution {
    pub fn is_beautiful_number(n: i32) -> bool {
        if n == 0 {
            return false;
        }
        let mut hash_map: HashMap<i32, i32> = HashMap::new();
        let mut vec = vec![];
        let mut i = n;
        let mut curr;

        while i > 0 {
            curr = i % 10;
            vec.push(curr);
            hash_map.entry(curr).and_modify(|a| *a += 1).or_insert(1);
            i = i / 10;
        }
        for val in vec {
            if hash_map.get(&val).is_some_and(|&count| count != val) {
                return false;
            }
        }
        true
    }
    pub fn get_beautiful_number() {
        let mut res = 0;
        let mut vec = vec![];
        for val in 0..=1000_0000 {
            if (Solution::is_beautiful_number(val)) {
                vec.push(val);
                print!("{},", val)
            }
        }
        println!("");
    }
    pub fn next_beautiful_number(n: i32) -> i32 {
        for &val in RESULT.iter() {
            if val > n {
                return val;
            }
        }
        0
    }
}

fn main() {
    Solution::get_beautiful_number();
}