Skip to content

Commit 0841c4f

Browse files
committed
猿辅导面经
1 parent eaa24ab commit 0841c4f

4 files changed

Lines changed: 18 additions & 32 deletions

File tree

Interview/mianjing/yuanfudao/my.md

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
一面:
2+
时间 8.28:15:00 时长50min
3+
4+
1. 自我介绍
5+
2. 介绍一下项目
6+
3. MySQL的索引
7+
4. 慢查询优化
8+
5. Redis的缓存穿透和雪崩
9+
6. Dubbo的负载均衡策略
10+
7. zk和redis实现分布式锁的原理
11+
8. MQ的特性
12+
9. RocketMQ事务消息的模型
13+
10. 如何维持幂等性
14+
11. final的关键字的作用
15+
12. final关键字修饰引用类型,那么在GC有什么特点
16+
13. 写题:非对称的对称二叉树

Interview/src/Main.java

Lines changed: 0 additions & 31 deletions
Original file line numberDiff line numberDiff line change
@@ -1,36 +1,5 @@
1-
import java.util.ArrayList;
2-
import java.util.List;
3-
41
public class Main {
5-
public static void main(String[] args) {
6-
int[] nums = {3, 2, 1, 6, 5, 4};
7-
ListNode node = ListNodeTools.getListNode(nums);
8-
ListNodeTools.printListNode(node);
9-
reorderList(node);
10-
ListNodeTools.printListNode(node);
11-
}
122

13-
public static void reorderList(ListNode head) {
14-
List<Integer> list = new ArrayList<>();
15-
ListNode p = head;
16-
while (p != null) {
17-
list.add(p.val);
18-
p = p.next;
19-
}
20-
int l = 0, r = list.size() - 1;
21-
int idx = 0;
22-
int[] nums = new int[list.size()];
23-
while (l < r) {
24-
nums[idx++] = list.get(l++);
25-
nums[idx++] = list.get(r--);
26-
}
27-
p = head;
28-
idx = 0;
29-
while (p != null) {
30-
p.val = nums[idx++];
31-
p = p.next;
32-
}
33-
}
343
}
354

365
class TreeNode {

Interview/src/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
public class Solution {
2-
2+
33
}

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -39,6 +39,7 @@
3939
- [贝壳面经](/Interview/mianjing/beike/my.md)
4040
- [腾讯面经](/Interview/mianjing/tx/my.md)
4141
- [作业帮面经](/Interview/mianjing/zuoyebang/my.md)
42+
- [猿辅导面经](/Interview/mianjing/yuanfudao/my.md)
4243

4344
## 我是这样回答的
4445
> 能力有限,但又想去钻研,面试中该怎么回答较好。(持续总结...)

0 commit comments

Comments
 (0)