Anran

借助javascript Map的特性：map的键是按照set的顺序存储的。 [MDN Map.prototype.keys()](https://developer.mozilla.org/zh-CN/docs/Web/JavaScript/Reference/Global_Objects/Map/keys) ```javascript var LRUCache = function(capacity) { this.cache = new Map() this.capacity = capacity } LRUCache.prototype.get = function(key) { if (this.cache.has(key)) { // 存在即更新 let temp =...

### 栈 ```javascript var trap = function (height) { let stack = []; let index = 0; let sumArea = 0; while (index < height.length) { while (stack.length !== 0...

```javascript /** * Initialize your data structure here. */ var RandomizedSet = function () { this.hash = {}; this.arr = []; }; /** * Inserts a value to the set....

```javascript /** * @param {number[]} nums1 * @param {number} m * @param {number[]} nums2 * @param {number} n * @return {void} Do not return anything, modify nums1 in-place instead. */...

```javascript var reverseWords = function (s) { let trimStr = s.trim(); let word = ''; let strQueue = []; for (let i = 0; i < trimStr.length; i++) { if...

### WeakMap ```javascript var getIntersectionNode = function (headA, headB) { let currenA = headA, currenB = headB; let map = new WeakMap(); while(currenA) { map.set(currenA, true); currenA = currenA.next; }...

```javascript var levelOrder = function(root) { let res = [], queue = []; if(!root) return res; queue.push(root); while(queue.length) { let len = queue.length; res.push([]); for(let i = 0;i

```javascript var maxSlidingWindow = function (nums, k) { // window存储下标 let window = [], res = []; for (let i = 0; i < nums.length; i++) { const num =...

```javascript var removeNthFromEnd = function (head, n) { // 哨兵节点 let dump = new ListNode(); dump.next = head; // 快慢指针 let fast = slow = dump; // 快指针先走n步 for (let...

```javascript var isSymmetric = function(root) { if(!root) return true; let quene = [root]; let tmpQueue = []; while(quene.length) { let len = quene.length; for(let i = 0;i