leetcode 1560. 圆形赛道上经过次数最多的扇区-耗时100-Most Visited Sector in a Circular Track

张开发
• 2026/4/18 8:24:12 • 15 分钟阅读

最新文章

推荐文章

相关文章

分享文章

leetcode 1560. 圆形赛道上经过次数最多的扇区-耗时100-Most Visited Sector in a Circular Track
Problem: 1560. 圆形赛道上经过次数最多的扇区-Most Visited Sector in a Circular Track耗时100%哈希表记录每个环访问的次数拿到最大值和对应的环编号Codeclass Solution { public: vectorint mostVisited(int n, vectorint rounds) { int m rounds.size() - 1, l, r; vectorint ump(n1, 0); for(int i 0; i m; i) { l rounds[i]; r rounds[i 1]; while(l!r) { ump[l]; l l1; if(l n) l % n; } } ump[rounds.back()]; vectorint ret; int mx *max_element(ump.begin(), ump.end()); for(int i 1; i n; i) { if(ump[i] mx) ret.push_back(i); } return ret; } };

更多文章