contributed by < kdnvt > :information_source: There are two branches in the GitHub repository. While main is the straightforward version, unrolling use the technique of loop unrolling to optimize the code. Palindrome Linked List (LeetCode 234) Description: Given the head of a singly linked list, return true if it is a palindrome or false otherwise. Constraints: The number of nodes in the list is in the range [1, 105]. 0 <= Node.val <= 9

contributed by < kdnvt > Rewrite Monotonic Array I choose the problem Monotonic Array from 張邦翰 , because I think I can use a more efficient and concise method to solve this problem. In addition, I want to apply loop unrolling and strip mining on a length-known array, because the linked list problem I chose for hw1 last time did not turn out to be very effective. Original C code: bool isMonotonic(int* nums, int numsSize){ bool a=false,d=false; int eq=0;