DeleteNodeInALinkedList237

Author: fluency03

Diff for: README.md

@@ -41,11 +41,11 @@
 
 
 
-# Total: 206
+# Total: 207
 
 | Easy |  Medium | Hard | - |
 |:----:|:-------:|:----:|:-:|
-|  47  |   120   |  38  | 1 |
+|  48  |   120   |  38  | 1 |
 
 
 | Question | Solution | Difficulty |
@@ -183,6 +183,7 @@
 | [230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/KthSmallestElementInABST230.java) | Medium |
 | [233. Number of Digit One](https://leetcode.com/problems/number-of-digit-one/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/NumberOfDigitOne233.java) | Hard |
 | [234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/PalindromeLinkedList234.java) | Easy |
+| [237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/DeleteNodeInALinkedList237.java) | Easy |
 | [240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/SearchA2DMatrixII240.java) | Medium |
 | [241. Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/DifferentWaysToAddParentheses241.java) | Medium |
 | [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [Solution](https://github.com/fluency03/leetcode-java/blob/master/src/ValidAnagram242.java) | Easy |

Diff for: src/DeleteNodeInALinkedList237.java

@@ -0,0 +1,26 @@
+/**
+ * Write a function to delete a node (except the tail) in a singly linked list,
+ * given only access to that node.
+ *
+ * Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third
+ * node with value 3, the linked list should become 1 -> 2 -> 4 after calling
+ * your function.
+ */
+
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+
+public class DeleteNodeInALinkedList237 {
+    public void deleteNode(ListNode node) {
+        if (node != null && node.next != null) {
+            node.val = node.next.val;
+            node.next = node.next.next;
+        }
+    }
+}