"Delete Node in a Linked List"

Author: lennylxx

README.md

@@ -24,6 +24,8 @@ You can build all the files using `make` (Use MinGW GCC and GNU Make on Windows)
 
 |     | Problem                                                      | Solution           |
 | --- | ------------------------------------------------------------ | ------------------ |
+| 237 | [Delete Node in a Linked List]                               | [C](src/237.c)     |
+| 236 | [Lowest Common Ancestor of a Binary Tree]                    |                    |
 | 235 | [Lowest Common Ancestor of a Binary Search Tree]             | [C](src/235.c)     |
 | 234 | [Palindrome Linked List]                                     | [C](src/234.c)     |
 | 233 | [Number of Digit One]                                        |                    |
@@ -248,6 +250,8 @@ You can build all the files using `make` (Use MinGW GCC and GNU Make on Windows)
 [LeetCode algorithm problems]: https://leetcode.com/problemset/algorithms/
 
 
+[Delete Node in a Linked List]: https://leetcode.com/problems/delete-node-in-a-linked-list/
+[Lowest Common Ancestor of a Binary Tree]: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
 [Lowest Common Ancestor of a Binary Search Tree]: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
 [Palindrome Linked List]: https://leetcode.com/problems/palindrome-linked-list/
 [Number of Digit One]: https://leetcode.com/problems/number-of-digit-one/

src/237.c

@@ -0,0 +1,45 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+struct ListNode {
+    int val;
+    struct ListNode *next;
+};
+
+void deleteNode(struct ListNode* node) {
+    if (node == NULL || node->next == NULL) return;
+
+    node->val = node->next->val;
+    node->next = node->next->next;
+}
+
+void printList(struct ListNode* head) {
+    while (head) {
+        printf("%d->", head->val);
+        head = head->next;
+    }
+    printf("N\n");
+}
+
+int main() {
+
+    struct ListNode *l1 = (struct ListNode *)calloc(3, sizeof(struct ListNode));
+
+    l1->val = 1;
+    l1->next = l1 + 1;
+
+    l1->next->val = 2;
+    l1->next->next = l1 + 2;
+
+    l1->next->next->val = 3;
+    l1->next->next->next = NULL;
+
+    printList(l1);
+
+    /* delete 2 */
+    deleteNode(l1->next);
+
+    printList(l1);
+
+    return 0;
+}