Aug26: get importance DFS [M]

DFS revisit M, traverse

daily/Aug26.cc

@@ -0,0 +1,44 @@
+#include <map>
+#include <vector>
+using namespace std;
+
+class Employee {
+ public:
+  int id;
+  int importance;
+  vector<int> subordinates;
+};
+
+class Solution {
+  map<int, Employee*> m;
+
+ public:
+  /**
+   * @brief Get the Importance object [M] DFS
+   * Time: O(N), Space: O(N)
+   *
+   * @param employees
+   * @param id
+   * @return int
+   */
+  int getImportance(vector<Employee*> employees, int id) {
+    int len = employees.size();
+    for (int i = 0; i < len; i++) {
+      m.insert({employees[i]->id, employees[i]});
+    }
+
+    return getValue(id);
+  }
+
+  int getValue(int id) {
+    Employee* master = m[id];
+    int ans = master->importance;
+    for (int& oid : master->subordinates) {
+      Employee* other = m[oid];
+      ans += other->importance;
+      for (int& sub : other->subordinates) ans += getValue(sub);
+    }
+
+    return ans;
+  }
+};

daily/cpp/Nov-28-Number-of-ways-to-divide-a-long-corridor.cpp

@@ -11,8 +11,7 @@ class Solution {
       if (corridor[i] == 'S') {
         chairs++;
 
-        while (++i < corridor.size() && corridor[i] != 'S')
-          ;
+        while (++i < corridor.size() && corridor[i] != 'S');
         // the while increment i and check each character in the corridor
         // string. the loop continues until the end of the string or until the
         // next chair.