返回介绍

solution / 3000-3099 / 3052.Maximize Items / README_EN

发布于 2024-06-17 01:02:57 字数 5025 浏览 0 评论 0 收藏 0

3052. Maximize Items

中文文档

Description

Table: Inventory

+----------------+---------+ 
| Column Name  | Type  | 
+----------------+---------+ 
| item_id    | int   | 
| item_type    | varchar |
| item_category  | varchar |
| square_footage | decimal |
+----------------+---------+
item_id is the column of unique values for this table.
Each row includes item id, item type, item category and sqaure footage.

Leetcode warehouse wants to maximize the number of items it can stock in a 500,000 square feet warehouse. It wants to stock as many prime items as possible, and afterwards use the remaining square footage to stock the most number of non-prime items.

Write a solution to find the number of prime and non-prime items that can be stored in the 500,000 square feet warehouse. Output the item type with prime_eligible followed by not_prime and the maximum number of items that can be stocked.

Note:

  • Item count must be a whole number (integer).
  • If the count for the not_prime category is 0, you should output 0 for that particular category.

Return _the result table ordered by item count in ascending order_.

The result format is in the following example.

 

Example 1:

Input: 
Inventory table:
+---------+----------------+---------------+----------------+
| item_id | item_type    | item_category | square_footage | 
+---------+----------------+---------------+----------------+
| 1374  | prime_eligible | Watches     | 68.00      | 
| 4245  | not_prime    | Art       | 26.40      | 
| 5743  | prime_eligible | Software    | 325.00     | 
| 8543  | not_prime    | Clothing    | 64.50      |  
| 2556  | not_prime    | Shoes     | 15.00      |
| 2452  | prime_eligible | Scientific  | 85.00      |
| 3255  | not_prime    | Furniture   | 22.60      | 
| 1672  | prime_eligible | Beauty    | 8.50       |  
| 4256  | prime_eligible | Furniture   | 55.50      |
| 6325  | prime_eligible | Food      | 13.20      | 
+---------+----------------+---------------+----------------+
Output: 
+----------------+-------------+
| item_type    | item_count  | 
+----------------+-------------+
| prime_eligible | 5400    | 
| not_prime    | 8       | 
+----------------+-------------+
Explanation: 
- The prime-eligible category comprises a total of 6 items, amounting to a combined square footage of 555.20 (68 + 325 + 85 + 8.50 + 55.50 + 13.20). It is possible to store 900 combinations of these 6 items, totaling 5400 items and occupying 499,680 square footage.
- In the not_prime category, there are a total of 4 items with a combined square footage of 128.50. After deducting the storage used by prime-eligible items (500,000 - 499,680 = 320), there is room for 2 combinations of non-prime items, accommodating a total of 8 non-prime items within the available 320 square footage.
Output table is ordered by item count in descending order.

Solutions

Solution 1: Join Query + Union All

First, we calculate the total area of all items of type prime_eligible and record it in the s field of table T.

Next, we calculate the number of items of type prime_eligible and not_prime respectively. For items of type prime_eligible, the number of portions we can store is $\lfloor \frac{500000}{s} \rfloor$. For items of type not_prime, the number of portions we can store is $\lfloor \frac{500000 \mod s}{\sum \text{s1}} \rfloor$. Where $\sum \text{s1}$ is the total area of all items of type not_prime. Multiplying by the number of items of type prime_eligible and not_prime respectively gives us our result.

# Write your MySQL query statement below
WITH
  T AS (
    SELECT SUM(square_footage) AS s
    FROM Inventory
    WHERE item_type = 'prime_eligible'
  )
SELECT
  'prime_eligible' AS item_type,
  COUNT(1) * FLOOR(500000 / s) AS item_count
FROM
  Inventory
  JOIN T
WHERE item_type = 'prime_eligible'
UNION ALL
SELECT
  'not_prime',
  IFNULL(COUNT(1) * FLOOR(IF(s = 0, 500000, 500000 % s) / SUM(square_footage)), 0)
FROM
  Inventory
  JOIN T
WHERE item_type = 'not_prime';

如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。

扫码二维码加入Web技术交流群

发布评论

需要 登录 才能够评论, 你可以免费 注册 一个本站的账号。
列表为空,暂无数据
    我们使用 Cookies 和其他技术来定制您的体验包括您的登录状态等。通过阅读我们的 隐私政策 了解更多相关信息。 单击 接受 或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
    原文