Leetcode #386. Lexicographical Numbers

[yokostan]

class Solution {
    public List<Integer> lexicalOrder(int n) {
        List<Integer> res = new ArrayList<>();
        String s = String.valueOf(n);

        for (int i = 1; i < 10; i++) {
            dfs(i, n, res);
        }
        return res;
    }    
    public void dfs(int cur, int n, List<Integer> res) {
        if (cur > n) return ;
        res.add(cur);
        for (int i = 0; i < 10; i++) {
            if (cur*10 + i > n) return;
            dfs(cur*10 + i, n, res);
        }

    }
}