New Problem "Remove Linked List Elements"

Author: haoel

README.md

@@ -7,6 +7,7 @@ LeetCode
 
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
+|187|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [C++](./algorithms/removeLinkedListElements/RemoveLinkedListElements.cpp)|Easy|
 |186|[Happy Number](https://leetcode.com/problems/happy-number/)| [C++](./algorithms/happyNumber/HappyNumber.cpp)|Easy|
 |185|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)| [C++](./algorithms/bitwiseANDOfNumbersRange/BitwiseAndOfNumbersRange.cpp)|Medium|
 |184|[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [C++](./algorithms/numberOfIslands/NumberOfIslands.cpp)|Medium|

algorithms/removeLinkedListElements/RemoveLinkedListElements.cpp

@@ -0,0 +1,44 @@
+// Source : https://leetcode.com/problems/remove-linked-list-elements/
+// Author : Hao Chen
+// Date   : 2015-06-09
+
+/********************************************************************************** 
+ * 
+ * Remove all elements from a linked list of integers that have value val.
+ * 
+ * Example
+ * Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6,  val = 6
+ * Return: 1 --> 2 --> 3 --> 4 --> 5
+ * 
+ * Credits:Special thanks to @mithmatt for adding this problem and creating all test cases.
+ *               
+ **********************************************************************************/
+
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode(int x) : val(x), next(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    ListNode* removeElements(ListNode* head, int val) {
+        static ListNode dummy(-1);
+        dummy.next = head;
+        ListNode *p = &dummy;
+        
+        while( p->next) {
+            if (p->next->val == val) {
+                p->next = p->next->next;
+            }else{
+                p = p->next;
+            }
+        }
+        
+        return dummy.next;
+    }
+};
+
+