LeetCode——1418. 点菜展示表[Display Table of Food Orders in a Restaurant][中等]——分析及代码[Java]
一、题目
给你一个数组 orders,表示客户在餐厅中完成的订单,确切地说, orders[i]=[customerNamei,tableNumberi,foodItemi] ,其中 customerNamei 是客户的姓名,tableNumberi 是客户所在餐桌的桌号,而 foodItemi 是客户点的餐品名称。
请你返回该餐厅的 点菜展示表 。在这张表中,表中第一行为标题,其第一列为餐桌桌号 “Table” ,后面每一列都是按字母顺序排列的餐品名称。接下来每一行中的项则表示每张餐桌订购的相应餐品数量,第一列应当填对应的桌号,后面依次填写下单的餐品数量。
注意:客户姓名不是点菜展示表的一部分。此外,表中的数据行应该按餐桌桌号升序排列。
示例 1:
输入:orders = [["David","3","Ceviche"],["Corina","10","Beef Burrito"],["David","3","Fried Chicken"],["Carla","5","Water"],["Carla","5","Ceviche"],["Rous","3","Ceviche"]]
输出:[["Table","Beef Burrito","Ceviche","Fried Chicken","Water"],["3","0","2","1","0"],["5","0","1","0","1"],["10","1","0","0","0"]]
解释:
点菜展示表如下所示:
Table,Beef Burrito,Ceviche,Fried Chicken,Water
3 ,0 ,2 ,1 ,0
5 ,0 ,1 ,0 ,1
10 ,1 ,0 ,0 ,0
对于餐桌 3:David 点了 "Ceviche" 和 "Fried Chicken",而 Rous 点了 "Ceviche"
而餐桌 5:Carla 点了 "Water" 和 "Ceviche"
餐桌 10:Corina 点了 "Beef Burrito"
示例 2:
输入:orders = [["James","12","Fried Chicken"],["Ratesh","12","Fried Chicken"],["Amadeus","12","Fried Chicken"],["Adam","1","Canadian Waffles"],["Brianna","1","Canadian Waffles"]]
输出:[["Table","Canadian Waffles","Fried Chicken"],["1","2","0"],["12","0","3"]]
解释:
对于餐桌 1:Adam 和 Brianna 都点了 "Canadian Waffles"
而餐桌 12:James, Ratesh 和 Amadeus 都点了 "Fried Chicken"
示例 3:
输入:orders = [["Laura","2","Bean Burrito"],["Jhon","2","Beef Burrito"],["Melissa","2","Soda"]]
输出:[["Table","Bean Burrito","Beef Burrito","Soda"],["2","1","1","1"]]
提示:
- 1 <= orders.length <= 5 * 10^4
- orders[i].length == 3
- 1 <= customerNamei.length, foodItemi.length <= 20
- customerNamei 和 foodItemi 由大小写英文字母及空格字符 ’ ’ 组成。
- tableNumberi 是 1 到 500 范围内的整数。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/display-table-of-food-orders-in-a-restaurant
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
二、分析及代码
1. 哈希表 + 有序表
(1)思路
先结合有序集合,获取所有餐品名称并排序,并在哈希表中记录各餐品对应的字典序编号。
再通过有序集和哈希表,遍历获取每桌各餐品订单的数量,并按桌号进行排序。
最后按要求输出点菜展示表。
(2)代码
class Solution {
public List<List<String>> displayTable(List<List<String>> orders) {
//获取所有餐品名称,及按字典序排序后对应的编号
Set<String> foodItems = new TreeSet<>();//有序集,存放所有餐品名称并排序
for (List<String> order : orders) {
foodItems.add(order.get(2));
}
int n = foodItems.size();//餐品总数
List<String> foodNames = new ArrayList<>();//点菜展示表的第一行
foodNames.add("Table");
Map<String, Integer> foodIds = new HashMap<>();//各餐品对应的编号
Iterator foodIt = foodItems.iterator();
while (foodIt.hasNext()) {
String food = (String)foodIt.next();
foodNames.add(food);
foodIds.put(food, foodNames.size() - 1);
}
//获取每桌各餐品订单数量
Map<Integer, HashMap<Integer, Integer>> map = new TreeMap<>();//有序集,按桌号排序
for (List<String> order : orders) {//遍历所有订单
int table = Integer.parseInt(order.get(1));//获取桌号
if (!map.containsKey(table))
map.put(table, new HashMap<Integer, Integer>());
int food = foodIds.get(order.get(2));//获取餐品编号
map.get(table).put(food, map.get(table).getOrDefault(food, 0) + 1);//对应餐品订单+1
}
//输出点菜展示表
List<List<String>> ans = new ArrayList<>();//点菜展示表
ans.add(foodNames);//添加标题
Iterator tableIt = map.entrySet().iterator();//遍历各桌餐品订单
while (tableIt.hasNext()) {
List<String> tableStr = new ArrayList<>(n + 1);//当前桌对应行
Map.Entry entry = (Map.Entry)tableIt.next();
int table = (int)entry.getKey();//桌号
tableStr.add(Integer.toString(table));
Map<Integer, Integer> foods = (Map<Integer, Integer>)entry.getValue();
for (int i = 1; i <= n; i++) {
if (foods.containsKey(i))//该编号餐品存在订单,输出订单数量
tableStr.add(Integer.toString(foods.get(i)));
else//该编号餐品无订单,输出0
tableStr.add("0");
}
ans.add(tableStr);//当桌点餐行加入点菜展示表
}
return ans;//输出点菜展示表
}
}
(3)结果
执行用时 :38 ms,在所有 Java 提交中击败了 72.29% 的用户;
内存消耗 :45.9 MB,在所有 Java 提交中击败了 81.93% 的用户。
三、其他
暂无。