Skip to content

修改a-2、b-2文字拼写及格式错误 #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Snailclimb merged 2 commits into from
Feb 18, 2021
Merged

修改a-2、b-2文字拼写及格式错误 #9

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3879b70
修改文字及格式错误
CNAHYZ Feb 16, 2021
e2617f5
修改文字拼写错误
CNAHYZ Feb 17, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions docs/a-2程序员简历如何写.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -95,7 +95,7 @@
### 1.2.7 其他的一些小tips

1. 尽量避免主观表述，少一点语义模糊的形容词，尽量要简洁明了，逻辑结构清晰。
2. 如果自己有博客或者个人技术栈点的话，写上去会为你加分很多。
2. 如果自己有博客或者个人技术站点的话，写上去会为你加分很多。
3. 如果自己的Github比较活跃的话，写上去也会为你加分很多。
4. 注意简历真实性，一定不要写自己不会的东西，或者带有欺骗性的内容
5. 项目经历建议以时间倒序排序，另外项目经历不在于多，而在于有亮点。
Expand All @@ -107,5 +107,5 @@
- Markdown简历排版工具：https://resume.mdnice.com/
- 超级简历 ： https://www.wondercv.com/
- best-resume-ever 基于Vue和LESS快速生成简历模板 ： https://github.com/salomonelli/best-resume-ever
4.极简简历 ： https://www.polebrief.com/index
- 极简简历 ： https://www.polebrief.com/index
- typora+markdown+css 自定义简历模板 ：https://github.com/Snailclimb/typora-markdown-resume
2 changes: 1 addition & 1 deletion docs/b-2Java集合.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -124,7 +124,7 @@ public interface RandomAccess {

### 2.2.7. HashSet如何检查重复

以下内容摘自我的 Java 启蒙书《Head fist java》第二版：
以下内容摘自我的 Java 启蒙书《Head first java》第二版：

当你把对象加入`HashSet`时，`HashSet` 会先计算对象的`hashcode`值来判断对象加入的位置，同时也会与其他加入的对象的 `hashcode` 值作比较，如果没有相符的 `hashcode`，`HashSet` 会假设对象没有重复出现。但是如果发现有相同 `hashcode` 值的对象，这时会调用`equals()`方法来检查 `hashcode` 相等的对象是否真的相同。如果两者相同，`HashSet` 就不会让加入操作成功。

Expand Down