示例 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,Water3    ,0           ,2      ,1            ,05    ,0           ,1      ,0            ,110   ,1           ,0      ,0            ,0对于餐桌 3：David 点了 "Ceviche" 和 "Fried Chicken"，而 Rous 点了 "Ceviche"而餐桌 5：Carla 点了 "Water" 和 "Ceviche"餐桌 10：Corina 点了 "Beef Burrito" 
来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/display-table-of-food-orders-in-a-restaurant著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

A NavigableSet implementation based on a TreeMap. The elements are ordered using their natural ordering, or by a Comparator provided at set creation time, depending on which constructor is used.This implementation provides guaranteed log(n) time cost for the basic operations (add, remove and contains).

A Red-Black tree based NavigableMap implementation. The map is sorted according to the natural ordering of its keys, or by a Comparator provided at map creation time, depending on which constructor is used.
This implementation provides guaranteed log(n) time cost for the containsKey, get, put and remove operations. Algorithms are adaptations of those in Cormen, Leiserson, and Rivest's Introduction to Algorithms.

public List<List<String>> displayTable(List<List<String>> orders) {        Set<String> foods = new TreeSet<>();         Set<String> tableNumbers = new TreeSet<>(new Comparator<String>() {            @Override            public int compare(String o1, String o2) {                return Integer.valueOf(o1) - Integer.valueOf(o2);            }        }); 
        Map<String ,Map<String, Integer>> tableFoodsNumber = new HashMap<>();        for (List<String> item : orders) {            String tableNumber = item.get(1);            String foodItem = item.get(2);
            if (!tableNumbers.contains(tableNumber)) {                tableNumbers.add(tableNumber);            }                       if (!foods.contains(foodItem)) {                foods.add(foodItem);            }
            Map<String, Integer> foodsNumber;            if (tableFoodsNumber.containsKey(tableNumber)) {                foodsNumber = tableFoodsNumber.get(tableNumber);            } else {                foodsNumber = new HashMap<>();            }
            foodsNumber.put(foodItem, foodsNumber.getOrDefault(foodItem, 0) + 1);            tableFoodsNumber.put(tableNumber, foodsNumber);        }
        List<List<String>> ans = new ArrayList<>();        List<String> first = new ArrayList<>();        first.add("Table");        for (String food : foods) {            first.add(food);        }        ans.add(first);
        for (String tableNumber : tableNumbers) {            List<String> temp = new ArrayList<>();            for (String i : first) {                if ("Table".equals(i)) {                    temp.add(tableNumber);                } else {                    temp.add(String.valueOf(tableFoodsNumber.get(tableNumber).getOrDefault(i, 0)));                }            }            ans.add(temp);        }
        return ans;    }