Frontier_Setter的博客

使用快慢指针，fast每走两步，slow走一步，当fast停下时，slow就应该停止在链表的中间。情况一：当链表有头结点head时，fast = head;slow = head;while(fast != NULL && fast->next != NULL){ fast = fast->next->next; slow = ...

先序遍历中序遍历迭代版1：class Solution {public: vector<int> inorderTraversal(TreeNode* root) { stack<TreeNode*> S; vector<int> result; TreeNode *cur...

转载自：https://leetcode.com/problems/single-number-ii/discuss/43296/An-General-Way-to-Handle-All-this-sort-of-questions.this kind of question the key idea is design a counter that record state. the ...

https://leetcode.com/problems/find-k-pairs-with-smallest-sums/You are given two integer arraysnums1andnums2sorted in ascending order and an integerk.Define a pair(u,v)which consists of one...

https://leetcode.com/problems/bulb-switcher/There arenbulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every thi...