Java | O(N: num of digits) | beats 100%
\nclass Solution {\n    public int[] getNoZeroIntegers(int n) {\n        int a=0, b=0, carry = 0 ;\n        int base = 1;\n        \n        while (n > 0){\n   
```\nclass Solution {\n    public int[] getNoZeroIntegers(int n) {\n        int a=0, b=0, carry = 0 ;\n        int base = 1;\n        \n        while (n > 0){\n            int v = n % 10 + carry;\n            if (v <2 && n >= 10){\n                carry = -1; // borrow 1 from higher digit\n                v += 10;\n            } else {\n                carry = 0;\n            }\n            a += base * (v / 2);\n            b += base * (v / 2 + v % 2);\n            base *= 10;\n            n /= 10;\n        }\n        return new int[]{a, b};\n    }\n    \n}\n```
[]