MCPcopy Create free account
hub / github.com/algorithm004-01/algorithm004-01 / Counter

Method Counter

Week 02/id_171/ValidAnagramSol.cs:28–48  ·  view source on GitHub ↗

计数器 一个循环，同时对计数器中的对应字母进行增加和减少，最后判断计数器中有没有不为零的。 时间复杂度是O(n)。

(string s, string t)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 5

firstUniqCharMethod · 0.80
firstUniqCharMethod · 0.80
majorityElement_2Function · 0.80
isAnagram_1Function · 0.80
isAngramCollectionsMethod · 0.80

Calls

no outgoing calls

Tested by

no test coverage detected