365. Water and Jug Problem

  • 26.5%

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.

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
> Example 1: (From the famous "Die Hard" example)
>
> Input: x = 3, y = 5, z = 4
> Output: True
>
1
2
3
4
5
> Example 2:
>
> Input: x = 2, y = 6, z = 5
> Output: False
>

java

Solution mine:

0ms, June.25th, 2016

1
2
3
4
5
6
7
8
9
10
11
12
public class Solution {
public boolean canMeasureWater(int x, int y, int z) {
if (z==x+y || z==x || z==y || z==0)
return true;
if (x==0 || y==0 || z>x+y || z%gcd(x, y)!= 0)
return false;
return true;
}
private int gcd(int a, int b){
return b == 0? a : gcd(b, a%b);
}
}

cpp

Solution 1:

0ms, June.25th, 2016

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution {
public:
bool canMeasureWater(int x, int y, int z) {
if (z==x+y || z==x || z==y || z==0)
return true;
if (x==0 || y==0 || z>x+y || z%gcd(x, y)!= 0)
return false;
return true;
}

private:
int gcd(int a, int b){
return b == 0? a : gcd(b, a%b);
}
};

python

Solution 1:

40ms, June.25th, 2016

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution(object):
def canMeasureWater(self, x, y, z):
"""
:type x: int
:type y: int
:type z: int
:rtype: bool
"""
if z == x+y or z == x or z == y or z == 0:
return True
if x == 0 or y == 0 or z > x+y or z%self.gcd(x, y) != 0:
return False
return True

def gcd(self, a, b):
return a if b == 0 else self.gcd(b, a%b)
谢谢你,可爱的朋友。