<p>There is a <strong>directed graph</strong> of <code>n</code> colored nodes and <code>m</code> edges. The nodes are numbered from <code>0</code> to <code>n - 1</code>.</p>

<p>You are given a string <code>colors</code> where <code>colors[i]</code> is a lowercase English letter representing the <strong>color</strong> of the <code>i<sup>th</sup></code> node in this graph (<strong>0-indexed</strong>). You are also given a 2D array <code>edges</code> where <code>edges[j] = [a<sub>j</sub>, b<sub>j</sub>]</code> indicates that there is a <strong>directed edge</strong> from node <code>a<sub>j</sub></code> to node <code>b<sub>j</sub></code>.</p>

<p>A valid <strong>path</strong> in the graph is a sequence of nodes <code>x<sub>1</sub> -&gt; x<sub>2</sub> -&gt; x<sub>3</sub> -&gt; ... -&gt; x<sub>k</sub></code> such that there is a directed edge from <code>x<sub>i</sub></code> to <code>x<sub>i+1</sub></code> for every <code>1 &lt;= i &lt; k</code>. The <strong>color value</strong> of the path is the number of nodes that are colored the <strong>most frequently</strong> occurring color along that path.</p>

<p>Return <em>the <strong>largest color value</strong> of any valid path in the given graph, or </em><code>-1</code><em> if the graph contains a cycle</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<p><img alt="" src="https://assets.leetcode.com/uploads/2021/04/21/leet1.png" style="width: 400px; height: 182px;" /></p>

<pre>
<strong>Input:</strong> colors = &quot;abaca&quot;, edges = [[0,1],[0,2],[2,3],[3,4]]
<strong>Output:</strong> 3
<strong>Explanation:</strong> The path 0 -&gt; 2 -&gt; 3 -&gt; 4 contains 3 nodes that are colored <code>&quot;a&quot; (red in the above image)</code>.
</pre>

<p><strong class="example">Example 2:</strong></p>

<p><img alt="" src="https://assets.leetcode.com/uploads/2021/04/21/leet2.png" style="width: 85px; height: 85px;" /></p>

<pre>
<strong>Input:</strong> colors = &quot;a&quot;, edges = [[0,0]]
<strong>Output:</strong> -1
<strong>Explanation:</strong> There is a cycle from 0 to 0.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == colors.length</code></li>
	<li><code>m == edges.length</code></li>
	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
	<li><code>0 &lt;= m &lt;= 10<sup>5</sup></code></li>
	<li><code>colors</code> consists of lowercase English letters.</li>
	<li><code>0 &lt;= a<sub>j</sub>, b<sub>j</sub>&nbsp;&lt; n</code></li>
</ul>
class Solution:
    def largestPathValue(self, colors: str, edges: List[List[int]]) -> int:
        n=len(colors)
        adjs=dict()
        for s,e in edges:
            if s in adjs:
                adjs[s].append(e)
            else:
                adjs[s]=[e]
        res=0
        cnts=[[0]*26 for _ in range(n)]
        visited=[False]*n
        inpath=[False]*n
        for i in range(n):
            tmp=self.dfs(i,adjs,colors,cnts,visited,inpath)
            if tmp==-1:
                return -1
            res=max(res,tmp)
        return res
    def dfs(self,cur,adjs,colors,cnts,visited,inpath):
        if inpath[cur]:
            return -1
        if visited[cur]:
            return cnts[cur][ord(colors[cur])-ord('a')]
        visited[cur]=True
        inpath[cur]=True
        if cur in adjs:
            for node in adjs[cur]:
                tmp=self.dfs(node,adjs,colors,cnts,visited,inpath)
                if tmp==-1:
                    return -1
                # if tmp[1]==colors[cur]
                
                for i in range(26):
                    cnts[cur][i]=max(cnts[node][i],cnts[cur][i])
        cnts[cur][ord(colors[cur])-ord('a')]+=1
        inpath[cur]=False
        return cnts[cur][ord(colors[cur])-ord('a')]

    


        # n=len(colors)
        # if len(edges)==0:
        #     return 1
    #     adjs=dict()
    #     seen=set()
    #     begin=set()
    #     for s,e in edges:
    #         seen.add(e)
    #         begin.add(s)
    #         if e==s:
    #             return -1
    #         if s not in adjs:
    #             adjs[s]=[e]
    #         else:
    #             adjs[s].append(e)
    #     starts=[]
    #     for i in begin:
    #         if i not in seen:
    #             starts.append(i)
    #     print(starts)
    #     # return 0
    #     for ss in starts:
                
    #         cnts=dict()
    #         cnts[colors[ss]]=1

    #         visited=set()
    #         self.dfs(ss,colors,adjs,cnts,visited)
    #     return self.res
    
    # def dfs(self,cur,colors,adjs,cnts,visited):
    #     if cur not in adjs:
    #         return 
    #     for sub in adjs[cur]:
    #         # if sub not in visited:
    #             # visited.add(sub)
    #         if colors[sub] in cnts:
    #             cnts[colors[sub]]+=1
    #         else:
    #             cnts[colors[sub]]=1
    #         self.res=max(self.res,cnts[colors[sub]])
    #         self.dfs(sub,colors,adjs,cnts,visited)
    #         cnts[colors[sub]]-=1
    #     return 

107235