feat: add cpp solution to lc problem: No.0332

Author: xzhseh

solution/0300-0399/0332.Reconstruct Itinerary/README.md

@@ -103,12 +103,12 @@ class Solution {
 ```cpp
 class Solution {
 public:
-    std::vector<std::string> findItinerary(std::vector<std::vector<std::string>> &tickets) {
-        std::unordered_map<std::string, std::priority_queue<std::string, std::vector<std::string>, std::greater<std::string>>> g;
-        std::vector<std::string> ret;
+    vector<string> findItinerary(vector<vector<string>>& tickets) {
+        unordered_map<string, priority_queue<string, vector<string>, greater<string>>> g;
+        vector<string> ret;
 
         // Initialize the graph
-        for (const auto &t : tickets) {
+        for (const auto& t : tickets) {
             g[t[0]].push(t[1]);
         }
 
@@ -119,7 +119,7 @@ public:
         return ret;
     }
 
-    void findItineraryInner(std::unordered_map<std::string, std::priority_queue<std::string, std::vector<std::string>, std::greater<std::string>>> &g, std::vector<std::string> &ret, std::string cur) {
+    void findItineraryInner(unordered_map<string, priority_queue<string, vector<string>, greater<string>>>& g, vector<string>& ret, string cur) {
         if (g.count(cur) == 0) {
             // This is the end point
             ret.push_back(cur);

solution/0300-0399/0332.Reconstruct Itinerary/README_EN.md

@@ -93,12 +93,12 @@ class Solution {
 ```cpp
 class Solution {
 public:
-    std::vector<std::string> findItinerary(std::vector<std::vector<std::string>> &tickets) {
-        std::unordered_map<std::string, std::priority_queue<std::string, std::vector<std::string>, std::greater<std::string>>> g;
-        std::vector<std::string> ret;
+    vector<string> findItinerary(vector<vector<string>>& tickets) {
+        unordered_map<string, priority_queue<string, vector<string>, greater<string>>> g;
+        vector<string> ret;
 
         // Initialize the graph
-        for (const auto &t : tickets) {
+        for (const auto& t : tickets) {
             g[t[0]].push(t[1]);
         }
 
@@ -109,7 +109,7 @@ public:
         return ret;
     }
 
-    void findItineraryInner(std::unordered_map<std::string, std::priority_queue<std::string, std::vector<std::string>, std::greater<std::string>>> &g, std::vector<std::string> &ret, std::string cur) {
+    void findItineraryInner(unordered_map<string, priority_queue<string, vector<string>, greater<string>>>& g, vector<string>& ret, string cur) {
         if (g.count(cur) == 0) {
             // This is the end point
             ret.push_back(cur);