【202308】【校招】2024秋招腾讯wxg前端一面面经 · 大厂前端面试真题

[1、手撕算法：快速排序，实现 + 讲解思路，时间复杂度是多少，怎么计算的时间复杂度？](1%E3%80%81%E6%89%8B%E6%92%95%E7%AE%97%E6%B3%95%EF%BC%9A%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F%EF%BC%8C%E5%AE%9E%E7%8E%B0+%E8%AE%B2%E8%A7%A3%E6%80%9D%E8%B7%AF%EF%BC%8C%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%E6%98%AF%E5%A4%9A%E5%B0%91%EF%BC%8C%E6%80%8E%E4%B9%88%E8%AE%A1%E7%AE%97%E7%9A%84%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%EF%BC%9F.md) [2、手撕算法：二叉树从上到下取和最多线路的和（且取的每个元素不能是相邻两个叶子节点），时间复杂度](2%E3%80%81%E6%89%8B%E6%92%95%E7%AE%97%E6%B3%95%EF%BC%9A%E4%BA%8C%E5%8F%89%E6%A0%91%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E5%8F%96%E5%92%8C%E6%9C%80%E5%A4%9A%E7%BA%BF%E8%B7%AF%E7%9A%84%E5%92%8C%EF%BC%88%E4%B8%94%E5%8F%96%E7%9A%84%E6%AF%8F%E4%B8%AA%E5%85%83%E7%B4%A0%E4%B8%8D%E8%83%BD%E6%98%AF%E7%9B%B8%E9%82%BB%E4%B8%A4%E4%B8%AA%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%EF%BC%89%EF%BC%8C%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6.md) [3、手撕算法：两个二叉树判断相同，数据结构如下，时间复杂度，还有其他方法吗？](3%E3%80%81%E6%89%8B%E6%92%95%E7%AE%97%E6%B3%95%EF%BC%9A%E4%B8%A4%E4%B8%AA%E4%BA%8C%E5%8F%89%E6%A0%91%E5%88%A4%E6%96%AD%E7%9B%B8%E5%90%8C%EF%BC%8C%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%A6%82%E4%B8%8B%EF%BC%8C%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%EF%BC%8C%E8%BF%98%E6%9C%89%E5%85%B6%E4%BB%96%E6%96%B9%E6%B3%95%E5%90%97%EF%BC%9F.md) [4、实际开发中为什么要避免用递归？递归会导致什么问题？](4%E3%80%81%E5%AE%9E%E9%99%85%E5%BC%80%E5%8F%91%E4%B8%AD%E4%B8%BA%E4%BB%80%E4%B9%88%E8%A6%81%E9%81%BF%E5%85%8D%E7%94%A8%E9%80%92%E5%BD%92%EF%BC%9F%E9%80%92%E5%BD%92%E4%BC%9A%E5%AF%BC%E8%87%B4%E4%BB%80%E4%B9%88%E9%97%AE%E9%A2%98%EF%BC%9F.md) [5、堆栈溢出是什么溢出？什么是堆，什么是栈？这里的堆栈和操作系统的堆栈一样吗？](5%E3%80%81%E5%A0%86%E6%A0%88%E6%BA%A2%E5%87%BA%E6%98%AF%E4%BB%80%E4%B9%88%E6%BA%A2%E5%87%BA%EF%BC%9F%E4%BB%80%E4%B9%88%E6%98%AF%E5%A0%86%EF%BC%8C%E4%BB%80%E4%B9%88%E6%98%AF%E6%A0%88%EF%BC%9F%E8%BF%99%E9%87%8C%E7%9A%84%E5%A0%86%E6%A0%88%E5%92%8C%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F%E7%9A%84%E5%A0%86%E6%A0%88%E4%B8%80%E6%A0%B7%E5%90%97%EF%BC%9F.md) [6、malloc()函数或数据回收会把数据放进堆还是栈？](6%E3%80%81malloc%E5%87%BD%E6%95%B0%E6%88%96%E6%95%B0%E6%8D%AE%E5%9B%9E%E6%94%B6%E4%BC%9A%E6%8A%8A%E6%95%B0%E6%8D%AE%E6%94%BE%E8%BF%9B%E5%A0%86%E8%BF%98%E6%98%AF%E6%A0%88%EF%BC%9F.md) [7、栈存什么，堆存什么？栈是先进后出还是先进先出？队列呢？](7%E3%80%81%E6%A0%88%E5%AD%98%E4%BB%80%E4%B9%88%EF%BC%8C%E5%A0%86%E5%AD%98%E4%BB%80%E4%B9%88%EF%BC%9F%E6%A0%88%E6%98%AF%E5%85%88%E8%BF%9B%E5%90%8E%E5%87%BA%E8%BF%98%E6%98%AF%E5%85%88%E8%BF%9B%E5%85%88%E5%87%BA%EF%BC%9F%E9%98%9F%E5%88%97%E5%91%A2%EF%BC%9F.md) [8、场景：Vue中设置一个data: count（初始0），页面中有一个 {{ count }}，还有一个按钮点一下就触发handler函数，页面上的count会怎么变化？为什么？](8%E3%80%81%E5%9C%BA%E6%99%AF%EF%BC%9AVue%E4%B8%AD%E8%AE%BE%E7%BD%AE%E4%B8%80%E4%B8%AA%60datacount%60%EF%BC%88%E5%88%9D%E5%A7%8B0%EF%BC%89%EF%BC%8C%E9%A1%B5%E9%9D%A2%E4%B8%AD%E6%9C%89%E4%B8%80%E4%B8%AA%60count%60%EF%BC%8C%E8%BF%98%E6%9C%89%E4%B8%80%E4%B8%AA%E6%8C%89%E9%92%AE%E7%82%B9%E4%B8%80%E4%B8%8B%E5%B0%B1%E8%A7%A6%E5%8F%91handler%E5%87%BD%E6%95%B0%EF%BC%8C%E9%A1%B5%E9%9D%A2%E4%B8%8A%E7%9A%84count%E4%BC%9A%E6%80%8E%E4%B9%88%E5%8F%98%E5%8C%96%EF%BC%9F%E4%B8%BA%E4%BB%80%E4%B9%88%EF%BC%9F.md) [9、什么是$nextTick，怎么判断什么时候我要进行$nextTick了](9%E3%80%81%E4%BB%80%E4%B9%88%E6%98%AF%60nextTick%60%EF%BC%8C%E6%80%8E%E4%B9%88%E5%88%A4%E6%96%AD%E4%BB%80%E4%B9%88%E6%97%B6%E5%80%99%E6%88%91%E8%A6%81%E8%BF%9B%E8%A1%8C%60nextTick%60%E4%BA%86.md) [10、什么是EventLoop？什么是宏任务，什么是微任务？怎么执行的？](10%E3%80%81%E4%BB%80%E4%B9%88%E6%98%AFEventLoop%EF%BC%9F%E4%BB%80%E4%B9%88%E6%98%AF%E5%AE%8F%E4%BB%BB%E5%8A%A1%EF%BC%8C%E4%BB%80%E4%B9%88%E6%98%AF%E5%BE%AE%E4%BB%BB%E5%8A%A1%EF%BC%9F%E6%80%8E%E4%B9%88%E6%89%A7%E8%A1%8C%E7%9A%84%EF%BC%9F.md) [11、那么EventLoop的机制是什么？假如你开发Vue，我怎么知道有没有微任务？](11%E3%80%81%E9%82%A3%E4%B9%88EventLoop%E7%9A%84%E6%9C%BA%E5%88%B6%E6%98%AF%E4%BB%80%E4%B9%88%EF%BC%9F%E5%81%87%E5%A6%82%E4%BD%A0%E5%BC%80%E5%8F%91Vue%EF%BC%8C%E6%88%91%E6%80%8E%E4%B9%88%E7%9F%A5%E9%81%93%E6%9C%89%E6%B2%A1%E6%9C%89%E5%BE%AE%E4%BB%BB%E5%8A%A1%EF%BC%9F.md) [12、宏任务有哪些？](12%E3%80%81%E5%AE%8F%E4%BB%BB%E5%8A%A1%E6%9C%89%E5%93%AA%E4%BA%9B%EF%BC%9F.md) [13、let i = 1; 是什么任务？](13%E3%80%81%60leti=1;%60%E6%98%AF%E4%BB%80%E4%B9%88%E4%BB%BB%E5%8A%A1%EF%BC%9F.md) [14、 JS有几个线程？](14%E3%80%81JS%E6%9C%89%E5%87%A0%E4%B8%AA%E7%BA%BF%E7%A8%8B%EF%BC%9F.md) [15、进程是什么？线程是什么？进程和线程的关系？](15%E3%80%81%E8%BF%9B%E7%A8%8B%E6%98%AF%E4%BB%80%E4%B9%88%EF%BC%9F%E7%BA%BF%E7%A8%8B%E6%98%AF%E4%BB%80%E4%B9%88%EF%BC%9F%E8%BF%9B%E7%A8%8B%E5%92%8C%E7%BA%BF%E7%A8%8B%E7%9A%84%E5%85%B3%E7%B3%BB%EF%BC%9F.md) [16、多核cpu多线程的情况下，线程用的是同一个CPU吗？](16%E3%80%81%E5%A4%9A%E6%A0%B8cpu%E5%A4%9A%E7%BA%BF%E7%A8%8B%E7%9A%84%E6%83%85%E5%86%B5%E4%B8%8B%EF%BC%8C%E7%BA%BF%E7%A8%8B%E7%94%A8%E7%9A%84%E6%98%AF%E5%90%8C%E4%B8%80%E4%B8%AACPU%E5%90%97%EF%BC%9F.md) [17、线程之间怎么通信？进程之间怎么通信？](17%E3%80%81%E7%BA%BF%E7%A8%8B%E4%B9%8B%E9%97%B4%E6%80%8E%E4%B9%88%E9%80%9A%E4%BF%A1%EF%BC%9F%E8%BF%9B%E7%A8%8B%E4%B9%8B%E9%97%B4%E6%80%8E%E4%B9%88%E9%80%9A%E4%BF%A1%EF%BC%9F.md) [18、场景：有线程A中一个地址指向数据，线程B可以直接拿这个数据吗？](18%E3%80%81%E5%9C%BA%E6%99%AF%EF%BC%9A%E6%9C%89%E7%BA%BF%E7%A8%8BA%E4%B8%AD%E4%B8%80%E4%B8%AA%E5%9C%B0%E5%9D%80%E6%8C%87%E5%90%91%E6%95%B0%E6%8D%AE%EF%BC%8C%E7%BA%BF%E7%A8%8BB%E5%8F%AF%E4%BB%A5%E7%9B%B4%E6%8E%A5%E6%8B%BF%E8%BF%99%E4%B8%AA%E6%95%B0%E6%8D%AE%E5%90%97%EF%BC%9F.md) [19、什么是信号量？干嘛的？](19%E3%80%81%E4%BB%80%E4%B9%88%E6%98%AF%E4%BF%A1%E5%8F%B7%E9%87%8F%EF%BC%9F%E5%B9%B2%E5%98%9B%E7%9A%84%EF%BC%9F.md) [21、什么是锁？有哪些锁？](21%E3%80%81%E4%BB%80%E4%B9%88%E6%98%AF%E9%94%81%EF%BC%9F%E6%9C%89%E5%93%AA%E4%BA%9B%E9%94%81%EF%BC%9F.md) [22、互斥锁实现机制？](22%E3%80%81%E4%BA%92%E6%96%A5%E9%94%81%E5%AE%9E%E7%8E%B0%E6%9C%BA%E5%88%B6%EF%BC%9F.md) [23、算法题实现思路](23%E3%80%81%E7%AE%97%E6%B3%95%E9%A2%98%E5%AE%9E%E7%8E%B0%E6%80%9D%E8%B7%AF.md) [24、递归做的，时间复杂度 O(2^n)](24%E3%80%81%E9%80%92%E5%BD%92%E5%81%9A%E7%9A%84%EF%BC%8C%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%60O2n%60.md) [25、递归做的，时间复杂度 O(n) ，其他方法说了一下推栈做（弄成数组的结构）](25%E3%80%81%E9%80%92%E5%BD%92%E5%81%9A%E7%9A%84%EF%BC%8C%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6%60On%60%EF%BC%8C%E5%85%B6%E4%BB%96%E6%96%B9%E6%B3%95%E8%AF%B4%E4%BA%86%E4%B8%80%E4%B8%8B%E6%8E%A8%E6%A0%88%E5%81%9A%EF%BC%88%E5%BC%84%E6%88%90%E6%95%B0%E7%BB%84%E7%9A%84%E7%BB%93%E6%9E%84%EF%BC%89.md)