摘要:
网址:https://leetcode.com/problems/house-robber/ 参考:https://leetcode.com/problems/house-robber/discuss/156523/From-good-to-great.-How-to-approach-most-o 阅读全文
摘要:
网址:https://leetcode.com/problems/binary-tree-inorder-traversal/ 参考:https://leetcode.com/problems/binary-tree-inorder-traversal/solution/ 二叉树的遍历一般有两种办法 阅读全文
摘要:
网址:https://leetcode.com/problems/maximum-binary-tree/ 参考: https://leetcode.com/problems/maximum-binary-tree/discuss/106146/C%2B%2B-O(N)-solution 我自己的做 阅读全文
摘要:
网址:https://leetcode.com/problems/binary-tree-level-order-traversal/ 参考:https://www.cnblogs.com/grandyang/p/4051321.html 二叉树的层次遍历的做法是维护一个队列,不断使节点入队,使用了 阅读全文
摘要:
网址:https://leetcode.com/problems/minimum-cost-for-tickets/ 参考:https://leetcode.com/problems/minimum-cost-for-tickets/discuss/226659/Two-DP-solutions-w 阅读全文
摘要:
网址:https://leetcode.com/problems/majority-element-ii/ 参考:https://blog.csdn.net/u014248127/article/details/79230221 摩尔投票算法( Boyer-Moore Voting Algorith 阅读全文
摘要:
网址:https://leetcode.com/problems/majority-element/ 参考:https://blog.csdn.net/u014248127/article/details/79230221 不断的消去两个不同的数,最后剩下的数肯定是所求的众数! 细节: 阅读全文
摘要:
网址:https://leetcode.com/problems/permutation-in-string/ 参考:https://leetcode.com/problems/permutation-in-string/discuss/102588/Java-Solution-Sliding-Wi 阅读全文