Skip to content

course: remove CS158 homework #29

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
merged 3 commits into from
Jun 21, 2020
Merged

course: remove CS158 homework #29

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
b83c20f
Update README.md
skyzh Jun 21, 2020
cdc9df4
Update README.md
skyzh Jun 21, 2020
7b9022f
ci: fix ci script
skyzh Jun 21, 2020
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
7 changes: 4 additions & 3 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,9 @@

请不要在课程评分尚未开始时上传当前课程的作业。

禁止抄袭、剽窃这些公开的项目。禁止将这些公开项目直接作为自己的作业提交。
禁止抄袭、剽窃这些公开的项目。

如果您的课程教师或助教明确表示该课程的相关内容不能被公开索引，请联系我们删除相关内容。

## 资源清单

Expand Down Expand Up @@ -61,8 +63,7 @@
* [@Galaxies, 2019 Spring](https://github.com/Galaxies99/CS158-Project-BTree)
* [@KoalaYan, 2019 Spring](https://github.com/KoalaYan/2019-CS158-DS_Project-BTree)
* [@skyzh, 2019 Spring](https://github.com/skyzh/BPlusTree)
* 小作业
* [@Galaxies, 2019 Spring](https://github.com/Galaxies99/CS158-Homework)
* 小作业：数据结构（荣誉）课程助教不建议公开索引代码。([#29](https://github.com/SJTU-CSE/awesome-cs/pull/29))

<a name="cs214"></a>
### CS214 - 算法与复杂性
Expand Down
2 changes: 2 additions & 0 deletions ci.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -55,6 +55,8 @@ def check_sequence(chunk):
def parse_bullet_list(chunk):
valid_lines = list(filter(lambda x: len(x.strip()) != 0, chunk))
space_list = list(map(count_space, valid_lines))
if not space_list:
return
if min(space_list) == max(space_list):
check_sequence(chunk)
else:
Expand Down