二元一次方程组
class Solution:
def numOfBurgers(self, tomatoSlices: int, cheeseSlices: int) -> List[int]:
t = (tomatoSlices - 2 * cheeseSlices) / 2
return [int(t), int(cheeseSlices - t)] if t >= 0 and t <= cheeseSlices and t == ceil(t) and t == floor(t) else []