[LeetCode] (medium) 365. Water and Jug Problem

https://leetcode.com/problems/water-and-jug-problem/

You are given two jugs with capacities x and ylitres. 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

---

由于每次只能舀一整杯的水或者倒一整杯的水（除此之外的操作都是无效的，如果把一杯不满的水倒掉，就相当于抹消了此前搞出这么小半杯水的所有操作，如果把一杯不满的水倒满，则相当于先倒掉再倒满）

所以问题归结于求 mx+ny=z 的可解性

由 裴蜀定理 / Bézout's identity 有z必须是xy的最大公约数的倍数

class Solution {
public:
    bool canMeasureWater(int x, int y, int z) {
        return (z == 0 || (x+y >= z && z%gcd(x, y)==0));
    }
    
    int gcd(int a, int b){
        while(b != 0){
            int tem = a % b;
            a = b;
            b = tem;
        }
        return a;
    }
};