【Leetcode】Water and Jug Problem

题目链接:https://leetcode.com/problems/water-and-jug-problem/

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

思路：
这种题目一般先考虑基本操作可以得到哪些结果，然后根据结果再递归执行获得更多结果。

首先考虑 x和 y可以量出那些z
基本操作：
1.先装满x，再将x倒入y直到溢出，则x剩下的为(x-y)=z
2.将上面得到的z装入y，此时可以认为y的空间为(y-z)，再执行上一步，得到新的z即x-(y-z)=x-(y-(x-y))=2*(x-y)
3.反复执行2操作可以量出z，z满足：n*(x-y)

所以如果x、y互质，他俩一定可以量出x-y=2，x-n*2=1，可以量出1，反复执行上述操作，可以量出[1,max{x,y}]之间任意的数。 题目要求z可以是两个jug之和，所以z可以量出的范围为[1,x+y]

若x、y不互质，则他俩可以先量出x-y，再根据上述操作量出n*(x-y)，其中n*(x-y)<=(x+y)

算法：

  public boolean canMeasureWater(int x, int y, int z) {
        if(x<y){ //x为被除数
            int tmp = x;
            x = y;
            y = tmp;
        }

        if(x==0)
            return x==z;
        if(y==0)
            return y==z;

        int gcd = calGCD(x,y);
        return z<=x+y&&z%gcd==0;
    }

    /**
     *辗转相除法求最大公约数 
     */
    public int calGCD(int x,int y){
        if(y==0)
            return x;
        return calGCD(y,x%y);
    }