松鼠模拟

// LeetCode 573: Squirrel Simulation
// 思路：
// 1. 使用Java Stream API来计算坚果和树的距离总和。
// 2. 使用Stream来找到松鼠到所有坚果的最小距离。
 
import java.util.stream.IntStream;
 
public class SquirrelSimulation {
    public int minDistance(int height, int width, int[] tree, int[] squirrel, int[][] nuts) {
        int totalDistance = IntStream.range(0, nuts.length)
                .map(i -> 2 * (Math.abs(nuts[i][0] - tree[0]) + Math.abs(nuts[i][1] - tree[1])))
                .sum();
 
        int minDistanceToNut = IntStream.range(0, nuts.length)
                .map(i -> Math.abs(nuts[i][0] - squirrel[0]) + Math.abs(nuts[i][1] - squirrel[1]) - (Math.abs(nuts[i][0] - tree[0]) + Math.abs(nuts[i][1] - tree[1])))
                .min()
                .orElse(0);
 
        return totalDistance + minDistanceToNut;
    }
}