Add solution #365

Author: JoshCrozier

README.md

@@ -287,6 +287,7 @@
 355|[Design Twitter](./0355-design-twitter.js)|Medium|
 357|[Count Numbers with Unique Digits](./0357-count-numbers-with-unique-digits.js)|Medium|
 363|[Max Sum of Rectangle No Larger Than K](./0363-max-sum-of-rectangle-no-larger-than-k.js)|Hard|
+365|[Water and Jug Problem](./0365-water-and-jug-problem.js)|Medium|
 367|[Valid Perfect Square](./0367-valid-perfect-square.js)|Easy|
 371|[Sum of Two Integers](./0371-sum-of-two-integers.js)|Medium|
 372|[Super Pow](./0372-super-pow.js)|Medium|

solutions/0365-water-and-jug-problem.js

@@ -0,0 +1,31 @@
+/**
+ * 365. Water and Jug Problem
+ * https://leetcode.com/problems/water-and-jug-problem/
+ * Difficulty: Medium
+ *
+ * You are given two jugs with capacities x liters and y liters. You have an infinite water
+ * supply. Return whether the total amount of water in both jugs may reach target using the
+ * following operations:
+ * - Fill either jug completely with water.
+ * - Completely empty either jug.
+ * - Pour water from one jug into another until the receiving jug is full, or the
+ *   transferring jug is empty.
+ */
+
+/**
+ * @param {number} x
+ * @param {number} y
+ * @param {number} target
+ * @return {boolean}
+ */
+var canMeasureWater = function(x, y, target) {
+  if (target > x + y) return false;
+  if (target === 0) return true;
+  if (x === 0) return target === y;
+  if (y === 0) return target === x;
+  return target % gcd(x, y) === 0;
+
+  function gcd(a, b) {
+    return b === 0 ? a : gcd(b, a % b);
+  }
+};