前端胖头鱼
``` javascript const intersection2 = (...arrays) => { if (arrays.length === 0) { return [] } if (arrays.length === 1) { return arrays[ 0 ] } return [ ...new Set(arrays.reduce((result,...
## 递归加遍历 ``` javascript var removeDuplicates = function(S) { if (S.length
## 利用栈 ``` javascript var removeDuplicates = function(S) { let charStack = [] for (let s of S) { const top = charStack[ charStack.length - 1 ] // 相等则把栈顶元素删除，并且当前元素不入栈 if...
## 递归 + 正则 ``` javascript var removeDuplicates = function(S) { const repeatLenStrRe = /(.)\1/g const replaceStr = S.replace(repeatLenStrRe, '') if (replaceStr === S) { return replaceStr } else {...
``` javascript const flattenUniqueSort = (array) => { // 拍平 const flatten = (array) => { return array.reduce((result, it) => { return result.concat(Array.isArray(it) ? flatten(it) : it) }, []) }...
``` javascript var isValid = function(s) { const charMap = { '(': ')', '[': ']', '{': '}', } const charStack = [] for (let i = 0, len = s.length;...
@liurentian 具体的实现原理已经写成文章了 [用原生js写一个"多动症"的简历](https://github.com/qianlongo/resume-native/blob/master/ARTICAL.md)，欢迎交流
@shanelau 一起学习交流
@JeseWang 一点点看，可以看懂得，欢迎一起学习交流哈
@yanyixin 我也花了很多时间才搞清楚😂