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
Approach
- 这是一道数学应用题,需要列方程求解,题目大意就是给你两个已知容量的容器,问你是否能测量出另一个不知容量大小的容器,我们设
ax+by=z
,我只要知道a
和b
是否有解即可,所以这里用到了扩展欧几里得算法的推论,ax+by=c
存在解的充要条件是c%gcd(a,b)==0
。
Code
class Solution {
public:
int GCD(int a, int b) {
if (b == 0)return a;
return GCD(b, a%b);
}
bool canMeasureWater(int x, int y, int z) {
if (z == 0 || ((x + y >= z) && z%GCD(x, y) == 0))return true;
return false;
}
};