private int findNoneZero(int n, int k) {
        int[] arr = new int[10];
        int index = 0;
        for (int i = 0; i < 10; i++) {
            if (i == k)
                continue;
            arr[index] = i;
            index++;
        }

        ArrayList<Integer> nineBase = getNineInvertedDigits(n);
        int result = 0;
        for (int i = nineBase.size() -1 ; i > -1; i--) {
            index = nineBase.get(i);
            result = result * 10 + arr[index];
        }

        return result;
    }