1.自我介绍
2.介绍下项目
3.vue双向绑定,缺陷,vue3的改进
4.算法:二叉树深度, var和let的区别
5.算法题:单次合并,当时程序没有运行成功,后来检查是一个地方单词拼写错了,最后的返回结果没有拼接
function WordsMerge(Words) { if (Words.length <= 1) { return JSON.stringify(Words); } else { let prev = [...Words[0]]; let i = 1; while ( i < Words.length) { let cur = [...Words[i]]; while (prev.length && cur.length && prev[prev.length - 1] === cur[0]) { prev.pop(); cur.shift(); } if (prev.concat(cur)) { prev = prev.concat(cur); i++; } else { prev = Words[i+1]; i += 2; } } return JSON.stringify(prev.join('')) } } var words = ['aab', 'bac', 'ccd', 'dde', 'efg']; var res = WordsMerge(words); console.log(res); // "acdfg"
全部评论
(7) 回帖