We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 9b72b2b + b698121 commit 7db0d54Copy full SHA for 7db0d54
queue.h
@@ -134,7 +134,7 @@ int q_size(struct list_head *head);
134
*
135
* The middle node of a linked list of size n is the
136
* ⌊n / 2⌋th node from the start using 0-based indexing.
137
- * If there're six elements, the third member should be returned.
+ * If there're six elements, the third member should be deleted.
138
139
* Reference:
140
* https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/
scripts/checksums
@@ -1,3 +1,3 @@
1
-45da6585400a15237f09d896bbb807f85f449e92 queue.h
+398b59c23f699ff1bf1e73a94503a9a91caa9207 queue.h
2
9be9666430f392924f5d27caa71a412527bf9267 list.h
3
3bb0192cee08d165fd597a9f6fbb404533e28fcf scripts/check-commitlog.sh
0 commit comments