LeetCode 365. Water and Jug Problem（数论）

365. Water and Jug Problem

Medium

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的水

思路

首先对于z=0, x=0, y=0, x+y<z, x=z, y=z的情况可以直接判断。
对于剩下的情况，问题等价于求整数a,b使得ax + by = z. 由裴蜀定理，存在整数a,b使得ax + by = gcd(x, y), 因此问题转化为判断z是否能被gcd(x, y)整除。

代码

class Solution {
    private int calGCD(int x, int y) {
        if (x == y) {
            return x;
        }
        if (x < y) {
            return y % x == 0? x: calGCD(y%x, x);
        } else {
            return x % y == 0? y: calGCD(x%y, y);
        }
    }
    
    public boolean canMeasureWater(int x, int y, int z) {
        if (z == 0) {
            return true;
        }
        if (x == 0) {
            return y == z;
        }
        if (y == 0) {
            return x == z;
        }
        if (x + y < z) {
            return false;
        }
        if (x == z || y == z) {
            return true;
        }
        if (z % calGCD(x, y) == 0) {
            return true;
        } else {
            return false;
        }
    }
}