Runtime: 1127 ms (Top 43.58%) | Memory: 202.6 MB (Top 28.30%)

Author: AnasImloul

scripts/algorithms/L/Largest Color Value in a Directed Graph/Largest Color Value in a Directed Graph.cpp

@@ -1,34 +1,35 @@
+// Runtime: 1127 ms (Top 43.58%) | Memory: 202.6 MB (Top 28.30%)
 class Solution {
 public:
     int largestPathValue(string colors, vector<vector<int>>& edges) {
         int n = colors.length();
         unordered_map<int,vector<int>> graph;
         vector<int> indegree(n,0);
-        
+
         for(auto e:edges){
             graph[e[0]].push_back(e[1]);
             indegree[e[1]]++;
         }
-        
+
         vector<vector<int>> charcount(n,vector<int>(26,0));
-        
+
         queue<int> q;
-        
+
         for(int i=0;i<n;i++){
             if(indegree[i]==0){
                 q.push(i);
             }
         }
-        
+
         int visited=0,ans=0;
-        
+
         while(!q.empty()){
             int curr = q.front();
             q.pop();
             visited++;
-            
+
             ans = max(ans,++charcount[curr][colors[curr]-'a']);
-            
+
             for(auto v:graph[curr]){
                 indegree[v]--;
                 if(indegree[v]==0)
@@ -38,10 +39,10 @@ class Solution {
                 }
             }
         }
-        
+
         if(visited!=n)
             return -1;
-        
+
         return ans;
     }
-};
+};