https://leetcode-cn.com/problems/majority-element/ class Solution { public: int majorityElement(vector<int>& nums) { int times = 0; int ans = 0; for (in...

https://leetcode-cn.com/problems/contains-duplicate-iii/ 方法1 class Solution { public: bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) { if (t<0 || k ==0...

https://leetcode-cn.com/problems/binary-search-tree-iterator/ 两个栈 class BSTIterator { public: BSTIterator(TreeNode* root) { inorder(root); dump_stack(); } /** @retu...

https://leetcode-cn.com/problems/find-peak-element/ 官方解答 遍历 class Solution { public: int findPeakElement(vector<int>& nums) { for (int i = 0; i < nums.size() - 1; ++i) ...

https://leetcode-cn.com/problems/search-in-rotated-sorted-array/ 查找特定数字，无重复数字 class Solution { public: int search(vector<int>& nums, int target) { int left = 0; int ri...

https://leetcode-cn.com/problems/binary-tree-preorder-traversal/（前序遍历） class Solution { public: vector<int> preorderTraversal(TreeNode* root) { if (root == NULL) return {}; ...

讲解：https://mp.weixin.qq.com/s/EWLi6sP3l4xsuc6GDpQAjw https://mp.weixin.qq.com/s/wK3zCwMtT04DdvTo-FzQ1Q https://leetcode-cn.com/problems/longest-increasing-subsequence/（LIS） O(N^2)解法 class So...

https://leetcode-cn.com/problems/copy-list-with-random-pointer/ map法： class Solution { public: Node* copyRandomList(Node* head) { if (head == NULL) return NULL; map<...

https://leetcode-cn.com/problems/reverse-linked-list/（整体反转） 迭代法 class Solution { public: ListNode* reverseList(ListNode* head) { ListNode *prev = NULL; ListNode *cur = head; ...