摘要：
/* // Definition for Employee. class Employee { public: int id; int importance; vector<int> subordinates; }; */ class Solution { public: int vis[10010 阅读全文
摘要：
用map统计边缘即可 最后求出哪个边缘出现次数cnt最多 返回n - cnt即可 class Solution { public: map<int, int> vis; set<int> s; int leastBricks(vector<vector<int>>& wall) { int n = 阅读全文