[Java] O(1) beats 100% - No solution can be faster than this one.
Tell me a solution faster than this one.\n\n```\n\npublic int[] getNoZeroIntegers(int n) {\n        int pos = 1;\n        int m = 0, num = n;\n        \n       
Tell me a solution faster than this one.\n\n```\n\npublic int[] getNoZeroIntegers(int n) {\n        int pos = 1;\n        int m = 0, num = n;\n        \n        while(n > 1){\n            int d = (n % 10);\n            if(d == 1){\n                m += 2 * pos;\n                n -= 2;\n            }else{\n                m += pos;\n                n -= 1;\n            }\n            \n            pos *= 10;\n            n /= 10;\n        }\n        \n        return new int[]{num - m, m};\n    }
[]