public class Solution {

    public int minDistance(int height, int width, int[] tree, int[] squirrel, int[][] nuts) {
        int diff = Integer.MAX_VALUE;
        int dist = 0;
        for (int i = 0; i < nuts.length; i++) {
            int val = distance(nuts[i], squirrel);
            int val1 = distance(nuts[i], tree);
            if (val - val1 <= diff)
                diff = val-val1;
            dist += 2 * val1;
        }
        dist += diff;
        return dist;
    }

    private int distance(int[] nut, int[] squirrel) {
        return Math.abs(nut[0] - squirrel[0]) + Math.abs(nut[1] - squirrel[1]);
    }
}