[LeetCode] Water and Jug Problem

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.
1
2
3
4
5
6
class Solution {
public:
bool canMeasureWater(int x, int y, int z) {
return !z || (x + y >= z && !(z % __gcd(x, y)));
}
};
Author: Song Hayoung
Link: https://songhayoung.github.io/2021/02/09/PS/LeetCode/water-and-jug-problem/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.