365. 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

http://blog.csdn.net/u012891472/article/details/50810575
这可以转换成一道最大公约数的题
x = 4, y = 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

class Solution {
public:
    bool canMeasureWater(int x, int y, int z) {
        if(z<0 || z > x + y) return false;
        if(x==z || y== z || x + y ==z) return true;
        int gcd = GCD(x,y);
        return z % gcd == 0;
    }
    int GCD(int x, int y){
        if(x < y) return GCD(y,x);
        if(y ==0) return x;
        if(x%2 ==0 && y%2 ==0) return 2*GCD(x/2,y/2);
        else if(x%2 == 0) return GCD(x/2,y);
        else if(y%2 == 0) return GCD(x,y/2);
        else return GCD(x-y,y);
    }
};