Leetcode: Water and Jug Problem && Summary: GCD求法（辗转相除法 or Euclidean algorithm）

You are given two jugs with capacities x and y litres. There is an infinite amount of water supply available. You need to determine whether it is possible to measure exactly z litres using these two jugs.

If z liters of water is measurable, you must have z liters of water contained within one or both buckets by the end.

Operations allowed:

Fill any of the jugs completely with water.

Empty any of the jugs.

Pour water from one jug into another till the other jug is completely full or the first jug itself is empty.

Example 1: (From the famous "Die Hard" example)

Input: x = 3, y = 5, z = 4

Output: True

Example 2:

Input: x = 2, y = 6, z = 5

Output: False

参考：https://discuss.leetcode.com/topic/49238/math-solution-java-solution

The basic idea is to use the property of Bézout's identity and check if z is a multiple of GCD(x, y)

Quote from wiki:

Bézout's identity (also called Bézout's lemma) is a theorem in the elementary theory of numbers:

let a and b be nonzero integers and let d be their greatest common divisor. Then there exist integers x
and y such that ax+by=d

In addition, the greatest common divisor d is the smallest positive integer that can be written as ax + by

every integer of the form ax + by is a multiple of the greatest common divisor d.

If x or y is negative this means we are emptying a jug of a or b gallons respectively.

Similarly if x or y is positive this means we are filling a jug of a or b gallons respectively.

a = 4, b = 6, z = 8.

GCD(4, 6) = 2

8 is multiple of 2

so this input is valid and we have:

-1 * 4 + 6 * 2 = 8

In this case, there is a solution obtained by filling the 6 gallon jug twice and emptying the 4 gallon jug once. (Solution. Fill the 6 gallon jug and empty 4 gallons to the 4 gallon jug. Empty the 4 gallon jug. Now empty the remaining two gallons from the 6 gallon jug to the 4 gallon jug. Next refill the 6 gallon jug. This gives 8 gallons in the end)

 public class Solution {

     public boolean canMeasureWater(int x, int y, int z) {

         if (z==x || z==y) return true; //deal with [1, 0, 0], [0, 0, 0] these true cases

         if (z > x + y) return false;

         return z % GCD(x, y) == 0;

     }

     public int GCD(int x, int y) {

         while (y != 0) {

             int temp = y;

             y = x%y;

             x = temp;

         }

         return x;

     }

 }

巴特西

Leetcode: Water and Jug Problem && Summary: GCD求法（辗转相除法 or Euclidean algorithm）

最新文章

热门文章