package TwitterOA4;

public class MinimumMoves {
    public int solution(int[] array, int[] target) {
        // assumption:
        //  a) array and target contain same amount items.
        //  b) items in array and target have same digits.
        //  c) all position numbers.
        int counter = 0;
        for (int i = 0; i < array.length; i++) {
            int digits = (int)(Math.log10(array[i]) + 1);
            for(int j = 1; j <= digits; j++) {
                int modulo = (int)(Math.pow(10, j));
                int divisor = modulo / 10;

                int digitA = array[i] % modulo / divisor;
                int digitT = target[i] % modulo / divisor;
                counter += Math.abs(digitA - digitT);
            }
        }

        return counter;
    }

    public static void main(String[] args) {
        MinimumMoves solution = new MinimumMoves();

        int[] inputArray = {1234, 4321};
        int[] inputTarget = {2345, 3214};

        System.out.println(solution.solution(inputArray, inputTarget));
    }
}