Add solution #573

Author: JoshCrozier

README.md

@@ -554,6 +554,7 @@
 567|[Permutation in String](./solutions/0567-permutation-in-string.js)|Medium|
 568|[Maximum Vacation Days](./solutions/0568-maximum-vacation-days.js)|Hard|
 572|[Subtree of Another Tree](./solutions/0572-subtree-of-another-tree.js)|Easy|
+573|[Squirrel Simulation](./solutions/0573-squirrel-simulation.js)|Medium|
 575|[Distribute Candies](./solutions/0575-distribute-candies.js)|Easy|
 576|[Out of Boundary Paths](./solutions/0576-out-of-boundary-paths.js)|Medium|
 581|[Shortest Unsorted Continuous Subarray](./solutions/0581-shortest-unsorted-continuous-subarray.js)|Medium|

solutions/0573-squirrel-simulation.js

@@ -0,0 +1,44 @@
+/**
+ * 573. Squirrel Simulation
+ * https://leetcode.com/problems/squirrel-simulation/
+ * Difficulty: Medium
+ *
+ * You are given two integers height and width representing a garden of size height x width.
+ * You are also given:
+ * - an array tree where tree = [treer, treec] is the position of the tree in the garden,
+ * - an array squirrel where squirrel = [squirrelr, squirrelc] is the position of the squirrel
+ *   in the garden,
+ * - and an array nuts where nuts[i] = [nutir, nutic] is the position of the ith nut in the garden.
+ *
+ * The squirrel can only take at most one nut at one time and can move in four directions: up, down,
+ * left, and right, to the adjacent cell.
+ *
+ * Return the minimal distance for the squirrel to collect all the nuts and put them under the tree
+ * one by one.
+ *
+ * The distance is the number of moves.
+ */
+
+/**
+ * @param {number} height
+ * @param {number} width
+ * @param {number[]} tree
+ * @param {number[]} squirrel
+ * @param {number[][]} nuts
+ * @return {number}
+ */
+var minDistance = function(height, width, tree, squirrel, nuts) {
+  const helper = (p1, p2) => Math.abs(p1[0] - p2[0]) + Math.abs(p1[1] - p2[1]);
+
+  let totalDistance = 0;
+  let maxSaving = -Infinity;
+
+  for (const nut of nuts) {
+    const nutToTree = helper(nut, tree);
+    totalDistance += 2 * nutToTree;
+    const squirrelToNut = helper(squirrel, nut);
+    maxSaving = Math.max(maxSaving, nutToTree - squirrelToNut);
+  }
+
+  return totalDistance - maxSaving;
+};