摘要：
A typical sliding window solution.class Solution { int rec[26]; // for a-z int rec1[26]; // for A-Z int cnt; int &getCnt(char c) ... 阅读全文
posted @ 2015-08-21 13:16
Tonix
阅读(126)
评论(0)
推荐(0)
摘要：
DFS to check cyclic. Please note some details.class Solution{ unordered_map> g; unordered_set visited; bool go(int i, int p) // true - cy... 阅读全文
posted @ 2015-08-21 12:41
Tonix
阅读(263)
评论(0)
推荐(0)
浙公网安备 33010602011771号