File tree Expand file tree Collapse file tree 2 files changed +2
-2
lines changed Expand file tree Collapse file tree 2 files changed +2
-2
lines changed Original file line number Diff line number Diff line change 19
19
** 这块内存区域也是线程私有的。**
20
20
21
21
## Java 堆
22
- Java 堆是整个虚拟机所管理的最大内存区域,所有的对象创建都是在这个区域进行内存分配。
22
+ ` Java ` 堆是整个虚拟机所管理的最大内存区域,所有的对象创建都是在这个区域进行内存分配。
23
23
24
24
这块区域也是垃圾回收器重点管理的区域,由于大多数垃圾回收器都采用` 分代回收算法 ` ,所有堆内存也分为 ` 新生代 ` 、` 老年代 ` ,可以方便垃圾的准确回收。
25
25
Original file line number Diff line number Diff line change 33
33
- [ 秒杀系统设计] ( https://github.com/crossoverJie/Java-Interview/blob/master/MD/Spike.md )
34
34
- [ 分布式缓存设计] ( https://github.com/crossoverJie/Java-Interview/blob/master/MD/Cache-design.md )
35
35
- [ 分布式 ID 生成器] ( https://github.com/crossoverJie/Java-Interview/blob/master/MD/ID-generator.md )
36
- - [ 限流算法] ( https://github.com/crossoverJie/Java-Interview/blob/master/MD/Limiting.md )
37
36
38
37
### DB 相关
39
38
48
47
- [ 链表是否有环] ( https://github.com/crossoverJie/Java-Interview/blob/master/src/main/java/com/crossoverjie/algorithm/LinkLoop.java#L32-L59 )
49
48
- [ 从一个数组中返回两个值相加等于目标值的下标] ( https://github.com/crossoverJie/Java-Interview/blob/master/src/main/java/com/crossoverjie/algorithm/TwoSum.java#L38-L59 )
50
49
- [ 一致 Hash 算法] ( https://github.com/crossoverJie/Java-Interview/blob/master/MD/Consistent-Hash.md )
50
+ - [ 限流算法] ( https://github.com/crossoverJie/Java-Interview/blob/master/MD/Limiting.md )
51
51
52
52
### 附加技能
53
53
You can’t perform that action at this time.
0 commit comments