hhh0209的博客

参考 https://blog.youkuaiyun.com/qq508618087/article/details/51753120

这个题目就是BFS和DFS问题 BFS参考https://blog.youkuaiyun.com/Jack_CJZ/article/details/78700238 DFS参考https://blog.youkuaiyun.com/fuxuemingzhu/article/details/82917037

这个问题可以用扫描线算法 参考https://blog.youkuaiyun.com/magicbean2/article/details/73613204 和https://blog.youkuaiyun.com/qq_32805671/article/details/84261853 还有一种思路，就是首先将建筑按照高度从小到大排序，再把高度依次映射到X轴上，后映射的覆盖先映射的，最后看映射值，映射值发生变化的...

很简单的题目 class Solution { public: bool isPalindrome(string s) { if (s.empty()) return true; int iSize = s.size(); int i = 0; do { if (!isalnum...

原理参考https://blog.youkuaiyun.com/qq_17550379/article/details/83572902 https://blog.youkuaiyun.com/lwgkzl/article/details/83502656 class Solution { public: vector<int> beautifulArray(int N) { v...