365. Water and Jug Problem
来源:互联网 发布:开淘宝店卖什么好 编辑:程序博客网 时间:2024/05/16 16:03
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 = 4Output: True
Example 2:
Input: x = 2, y = 6, z = 5Output: False
class Solution { private int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } public boolean canMeasureWater(int x, int y, int z) { return z == 0 || (z <= x + y && z % gcd(x, y) == 0); } }
阅读全文
0 0
- 365. Water and Jug Problem
- 365. Water and Jug Problem
- 365. Water and Jug Problem
- 365. Water and Jug Problem
- 365. Water and Jug Problem
- 365. Water and Jug Problem
- 365. Water and Jug Problem
- 365. Water and Jug Problem
- 365. Water and Jug Problem
- 365. Water and Jug Problem
- [LeetCode]problem 365. Water and Jug Problem
- Water and Jug Problem
- Water and Jug Problem
- Water and Jug Problem
- Water and Jug Problem
- leetcode.365. Water and Jug Problem
- LeetCode 365. Water and Jug Problem
- LeetCode—365. Water and Jug Problem
- 图片一句话木马简单制作方法
- SpringMVC比较全面的文件上传下载
- 不是这世界变化快,而是……
- Java 成绩排序
- Opencv核心基础,功能精华
- 365. Water and Jug Problem
- WC2006 水管局长 LCT维护MST
- python机器学习(Python Machine Learning)
- 交易系统中的观察者模式
- 每天一个linux命令(30): chown命令
- 软件测试章节知识点总结
- 简单选择排序
- “自顶向下,逐步求精“的程序设计方法
- 网口的桥接