zoukankan      html  css  js  c++  java
  • [Swift]LeetCode1276. 不浪费原料的汉堡制作方案 | Number of Burgers with No Waste of Ingredients

    ★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
    ➤微信公众号:山青咏芝(let_us_code)
    ➤博主域名:https://www.zengqiang.org
    ➤GitHub地址:https://github.com/strengthen/LeetCode
    ➤原文地址:https://www.cnblogs.com/strengthen/p/12151543.html
    ➤如果链接不是山青咏芝的博客园地址,则可能是爬取作者的文章。
    ➤原文已修改更新!强烈建议点击原文地址阅读!支持作者!支持原创!
    ★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

    Given two integers tomatoSlices and cheeseSlices. The ingredients of different burgers are as follows:

    Jumbo Burger: 4 tomato slices and 1 cheese slice.
    Small Burger: 2 Tomato slices and 1 cheese slice.
    Return [total_jumbo, total_small] so that the number of remaining tomatoSlices equal to 0 and the number of remaining cheeseSlices equal to 0. If it is not possible to make the remaining tomatoSlices and cheeseSlices equal to 0 return [].

    Example 1:

    Input: tomatoSlices = 16, cheeseSlices = 7
    Output: [1,6]
    Explantion: To make one jumbo burger and 6 small burgers we need 4*1 + 2*6 = 16 tomato and 1 + 6 = 7 cheese. There will be no remaining ingredients.
    Example 2:

    Input: tomatoSlices = 17, cheeseSlices = 4
    Output: []
    Explantion: There will be no way to use all ingredients to make small and jumbo burgers.
    Example 3:

    Input: tomatoSlices = 4, cheeseSlices = 17
    Output: []
    Explantion: Making 1 jumbo burger there will be 16 cheese remaining and making 2 small burgers there will be 15 cheese remaining.
    Example 4:

    Input: tomatoSlices = 0, cheeseSlices = 0
    Output: [0,0]
    Example 5:

    Input: tomatoSlices = 2, cheeseSlices = 1
    Output: [0,1]
     

    Constraints:

    0 <= tomatoSlices <= 10^7
    0 <= cheeseSlices <= 10^7


    圣诞活动预热开始啦,汉堡店推出了全新的汉堡套餐。为了避免浪费原料,请你帮他们制定合适的制作计划。

    给你两个整数 tomatoSlices 和 cheeseSlices,分别表示番茄片和奶酪片的数目。不同汉堡的原料搭配如下:

    巨无霸汉堡:4 片番茄和 1 片奶酪
    小皇堡:2 片番茄和 1 片奶酪
    请你以 [total_jumbo, total_small]([巨无霸汉堡总数,小皇堡总数])的格式返回恰当的制作方案,使得剩下的番茄片 tomatoSlices 和奶酪片 cheeseSlices 的数量都是 0。

    如果无法使剩下的番茄片 tomatoSlices 和奶酪片 cheeseSlices 的数量为 0,就请返回 []。

    示例 1:

    输入:tomatoSlices = 16, cheeseSlices = 7
    输出:[1,6]
    解释:制作 1 个巨无霸汉堡和 6 个小皇堡需要 4*1 + 2*6 = 16 片番茄和 1 + 6 = 7 片奶酪。不会剩下原料。
    示例 2:

    输入:tomatoSlices = 17, cheeseSlices = 4
    输出:[]
    解释:只制作小皇堡和巨无霸汉堡无法用光全部原料。
    示例 3:

    输入:tomatoSlices = 4, cheeseSlices = 17
    输出:[]
    解释:制作 1 个巨无霸汉堡会剩下 16 片奶酪,制作 2 个小皇堡会剩下 15 片奶酪。
    示例 4:

    输入:tomatoSlices = 0, cheeseSlices = 0
    输出:[0,0]
    示例 5:

    输入:tomatoSlices = 2, cheeseSlices = 1
    输出:[0,1]
     

    提示:

    0 <= tomatoSlices <= 10^7
    0 <= cheeseSlices <= 10^7

  • 相关阅读:
    B树、B-树、B+树、B*树介绍,和B+树更适合做文件索引的原因
    异步请求数据加载到表格后根据不同状态改变表格背景颜色【表格背景色】
    Linux/windows查看设置环境变量指令
    【周期性执行事件】MySQL事件(Event)&任务调度
    DEDE列表页调用TAG标签
    poj2488 A Knight's Journey
    [置顶] Codeforces Round #190 (Div. 2)(完全)
    SharePoint 2010 用Event Receiver将文件夹自动变成approved状态 (2)
    .NET领域驱动设计—初尝(三:穿过迷雾走向光明)
    Android解决异常apk on device '0292bea1': Unable to open sync connection!
  • 原文地址:https://www.cnblogs.com/strengthen/p/12151543.html
Copyright © 2011-2022 走看看