LeetCode 292. Nim 游戏（Easy）/ 319. 灯泡开关（M）/ 365. 水壶问题（M）

• 题目链接

class Solution:
    # 0208 数学法（40 ms，14.9 MB）
    def canWinNim(self, n: int) -> bool:
        return n % 4 != 0

319. 灯泡开关

• 官方题解
  

365. 水壶问题

• 官方题解（2种）
• 解法1：深度优先搜索
  

class Solution:
    # 使用栈来模拟递归
    def canMeasureWater(self, x: int, y: int, z: int) -> bool:
        stack = [(0, 0)]
        self.seen = set()

        while stack:
            remain_x, remain_y = stack.pop()

            if remain_x == z or remain_y == z or remain_x + remain_y == z:
                return True

            if (remain_x, remain_y) in self.seen:
                continue

            self.seen.add((remain_x, remain_y))

            # 把 X 壶灌满
            stack.append((x, remain_y))
            # 把 Y 壶灌满
            stack.append((remain_x, y))
            # 把 X 壶倒空
            stack.append((0, remain_y))
            # 把 Y 壶倒空
            stack.append((remain_x, 0))
            # 把 X 壶的水灌进 Y 壶，直至灌满或倒空
            stack.append((remain_x - min(remain_x, y - remain_y), remain_y + min(remain_x, y - remain_y)))
            # 把 Y 壶的水灌进 X 壶，直至灌满或倒空
            stack.append((remain_x + min(remain_y, x - remain_x), remain_y - min(remain_y, x - remain_x)))

        return False

• 解法2：数学（贝祖定理）