solution/0700-0799/0753.Cracking the Safe/Solution.java at main

main

leetcode-swift

393 issues
2 pull requests
5,000 files
1 active branch

List view

solution\0700-0799\0753.Cracking the Safe\Solution.java

4 Complexity
2 Complexity / M
0 Duplication
1 Churn
23 Lines
21 Lines of Code
2 Methods
10.5 LOC / Method

class Solution {
    private Set<Integer> vis = new HashSet<>();
    private StringBuilder ans = new StringBuilder();
    private int mod;

    public String crackSafe(int n, int k) {
        mod = (int) Math.pow(10, n - 1);
        dfs(0, k);
        ans.append("0".repeat(n - 1));
        return ans.toString();
    }

    private void dfs(int u, int k) {
        for (int x = 0; x < k; ++x) {
            int e = u * 10 + x;
            if (vis.add(e)) {
                int v = e % mod;
                dfs(v, k);
                ans.append(x);
            }
        }
    }
}