Skip to content

Fix incorrect comments #219

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 1 commit into from
Mar 2, 2025
Merged

Fix incorrect comments #219

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
2 changes: 1 addition & 1 deletion queue.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -134,7 +134,7 @@ int q_size(struct list_head *head);
*
* The middle node of a linked list of size n is the
* ⌊n / 2⌋th node from the start using 0-based indexing.
* If there're six elements, the third member should be returned.
* If there're six elements, the third member should be deleted.
*
* Reference:
* https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/
Expand Down
2 changes: 1 addition & 1 deletion scripts/checksums
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,3 @@
45da6585400a15237f09d896bbb807f85f449e92 queue.h
398b59c23f699ff1bf1e73a94503a9a91caa9207 queue.h
9be9666430f392924f5d27caa71a412527bf9267 list.h
3bb0192cee08d165fd597a9f6fbb404533e28fcf scripts/check-commitlog.sh
Loading