Clean Python 3, hashmap O(N + TlogT + FlogF + T * F)
It\'s quit straightforward to use a hashmap to save meals that each table has.\nTime: O(N + TlogT + FlogF + T * F)\nN, T, F stands for amount of orders, tables 
It\'s quit straightforward to use a hashmap to save meals that each table has.\nTime: `O(N + TlogT + FlogF + T * F)`\n`N`, `T`, `F` stands for amount of orders, tables and foods\nCost come from iterating orders and sorting tables and foods.\nAnd the last `for` takes `T * F` to dump the result.\nSpace: `O(T * F)`\n```\nimport collections\nclass Solution:\n    def displayTable(self, orders: List[List[str]]) -> List[List[str]]:\n        desk = collections.defaultdict(collections.Counter)\n        meal = set()\n        for _, table, food in orders:\n            meal.add(food)\n            desk[table][food] += 1\n        foods = sorted(meal)\n        result = [[\'Table\'] + [food for food in foods]]\n        for table in sorted(desk, key=int):\n            result.append([table] + [str(desk[table][food]) for food in foods])\n        return result\n```
[]