C++ Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/*\n\u6BCF\u500B order \u7684\u5167\u5BB9\u4EE3\u8868\n0. \u5BA2\u4EBA\u540D\u5B57\n1. \u684C\u865F\n2. \u98DF\u7269\n*/\n\nclass Solution {\npublic:\n    static bool compare(vector<string> &vec1, vector<string> &vec2){\n        return stoi(vec1[0]) < stoi(vec2[0]);\n    }\n\n    vector<vector<string>> displayTable(vector<vector<string>>& orders) {\n        unordered_map<string, unordered_map<string, int>> hash; // <\u684C\u865F, <\u98DF\u7269, \u6578\u91CF>>\n        set<string> foods = {};\n        vector<string> head_row = {"Table"};\n        vector<vector<string>> result;\n\n        string table;\n        for(auto &vec:orders){\n            table = vec[1];\n            string food = vec[2];\n            foods.insert(food); // record the category of the food\n            hash[table][food]++;\n        }\n\n        // head row\n        for(auto &ele:foods){\n            head_row.push_back(ele);\n        }\n        // result.push_back(head_row);\n\n        for(auto iter=hash.begin(); iter!=hash.end(); iter++){\n            vector<string> temp;\n            table = iter->first;\n            temp.push_back(table);\n\n            unordered_map<string, int> food_table = iter->second;\n            for(auto &food:foods){\n                if(food_table[food] == 0){\n                    temp.push_back("0");\n                }\n                else{\n                    temp.push_back(to_string(food_table[food]));\n                }\n            }\n            result.push_back(temp);\n        }\n        sort(result.begin(), result.end(), compare);\n\n        result.insert(result.begin(), head_row);\n\n        return result;\n    }\n};\n```
['Hash Table', 'Sorting', 'C++']