[leetcode] 365. 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.

Operations allowed:

• Fill any of the jugs completely.
• 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:

Input: x = 2, y = 6, z = 4
Output: True

Example 2:

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

思路: 1. z必须小于x, y的最大的一个. 2. z必须可以除尽x和y的最大公约数. 几天不见, 这题又改了测试用例, 原来大于x, y的z是false的, 现在z大于x, y也可以了.

代码如下:

class Solution {
public:
    int gcd(int x, int y)
    {
        return y==0?x:gcd(y, x%y);
    }
    
    bool canMeasureWater(int x, int y, int z) {
        if(z > x+y) return false;
        return z==0?true:z%gcd(x, y) ==0;
    }
};

参考: https://leetcode.com/discuss/110235/c-solution-using-euclidean-algorithm