[LeetCode] 365. Water and Jug Problem 水罐问题

 

You are given two jugs with capacities jug1Capacity and jug2Capacity liters. There is an infinite amount of water supply available. Determine whether it is possible to measure exactly targetCapacity liters using these two jugs.

If targetCapacity liters of water are measurable, you must have targetCapacity liters of water contained within one or both buckets by the end.

Operations allowed:

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

Input: jug1Capacity = 3, jug2Capacity = 5, targetCapacity = 4
Output: true
Explanation: The famous Die Hard example 

Example 2:

Input: jug1Capacity = 2, jug2Capacity = 6, targetCapacity = 5
Output: false

Example 3:

Input: jug1Capacity = 1, jug2Capacity = 2, targetCapacity = 3
Output: true

 

Constraints:

  • 1 <= jug1Capacity, jug2Capacity, targetCapacity <= 10^6

Credits:
Special thanks to @vinod23 for adding this problem and creating all test cases.

 

这是一道脑筋急转弯题,很多人以前应该听过这道题目,有一个容量为3升和一个容量为5升的水罐,问我们如何准确的称出4升的水。很多人都知道怎么做,先把5升水罐装满水,倒到3升水罐里,这时5升水罐里还有2升水,然后把3升水罐里的水都倒掉,把5升水罐中的2升水倒入3升水罐中,这时候把5升水罐解满,然后往此时有2升水的3升水罐里倒水,这样5升水罐倒出1升后还剩4升即为所求。这个很多人都知道,但是这道题随意给了三个参数,问有没有解法,这就比较难了。这里博主就照搬网上大神的讲解吧:

这道问题其实可以转换为有一个很大的容器,有两个杯子,容量分别为x和y,问通过用两个杯子往里倒水,和往出舀水,问能不能使容器中的水刚好为z升。那么这里可以用一个公式来表达:

z = m * x + n * y

其中m,n为舀水和倒水的次数,正数表示往里舀水,负数表示往外倒水,题目中的例子可以写成: 4 = (-2) * 3 + 2 * 5,即3升的水罐往外倒了两次水,5升水罐往里舀了两次水。问题就变成了对于任意给定的 x,y,z,存不存在m和n使得上面的等式成立。根据裴蜀定理,是等式 ax + by = d 中的x和y有解的d最小正值为 gcd(x, y),当d为 gcd(x, y) 的倍数时,也是有解的。所以只要 z % gcd(x, y) == 0,上面的等式就有解,所以问题就迎刃而解了,只要看z是不是x和y的最大公约数的倍数就行了,别忘了还有个限制条件 x + y >= z,因为x和y不可能称出比它们之和还多的水,参见代码如下;

 

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 x, int y) {
        return y == 0 ? x : gcd(y, x % y);
    }
};

 

Github 同步地址:

https://github.com/grandyang/leetcode/issues/365

 

参考资料:

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

https://leetcode.com/problems/water-and-jug-problem/discuss/83715/Math-solution-Java-solution

 

LeetCode All in One 题目讲解汇总(持续更新中...)

posted @ 2016-06-30 08:55  Grandyang  阅读(14281)  评论(12编辑  收藏  举报
Fork me on GitHub