Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 365 with 26 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 365 # by problem number
lcpy gen -s water_and_jug_problem # by problem name
x liters and y liters. You have an infinite water supply. Return whether the total amount of water in both jugs may reach target using the following operations:
Input: x = 3, y = 5, target = 4
Output: true
Explanation:
Fill the 5-liter jug (0, 5). Pour from the 5-liter jug into the 3-liter jug, leaving 2 liters (3, 2). Empty the 3-liter jug (0, 2). Transfer the 2 liters from the 5-liter jug to the 3-liter jug (2, 0). Fill the 5-liter jug again (2, 5). Pour from the 5-liter jug into the 3-liter jug until the 3-liter jug is full. This leaves 4 liters in the 5-liter jug (3, 4). Empty the 3-liter jug. Now, you have exactly 4 liters in the 5-liter jug (0, 4).
Input: x = 2, y = 6, target = 5
Output: false
Input: x = 1, y = 2, target = 3
Output: true
Explanation: Fill both jugs. The total amount of water in both jugs is equal to 3 now.
1 <= x, y, target <= 10^3from math import gcd
class Solution:
# Time: O(log(min(x, y)))
# Space: O(1)
def can_measure_water(self, x: int, y: int, target: int) -> bool:
if target > x + y:
return False
return target % gcd(x, y) == 0
| Time | Space |
|---|---|
| O(log(min(x, y))) | O(1) |