Merge pull request #29 from fluttermiddlepodcast/27_Remove_Element

added "27. Remove Element"

Author: fluttermiddlepodcast

README.md

@@ -8,6 +8,7 @@ Solutions from [LeetCode](https://leetcode.com) on Dart.
 |---------------------------------------------|------------------------------------------------------------------------------|---------------------------------------------------------------|
 | 9. Palindrome Number                        | [Link](https://leetcode.com/problems/palindrome-number/)                     | [Link](./lib/easy/palindrome_number.dart)                     |
 | 26. Remove Duplicates from Sorted Array     | [Link](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)   | [Link](./lib/easy/remove_duplicates_from_sorted_array.dart)   |
+| 27. Remove Element                          | [Link](https://leetcode.com/problems/remove-element/)                        | [Link](./lib/easy/remove_element.dart)                        |
 | 136. Single Number                          | [Link](https://leetcode.com/problems/single-number/)                         | [Link](./lib/easy/single_number.dart)                         |
 | 144. Binary Tree Preorder Traversal         | [Link](https://leetcode.com/problems/binary-tree-preorder-traversal/)        | [Link](./lib/easy/binary_tree_preorder_traversal.dart)        |
 | 169. Majority Element                       | [Link](https://leetcode.com/problems/majority-element/)                      | [Link](./lib/easy/majority_element.dart)                      |

lib/easy/remove_element.dart

@@ -0,0 +1,11 @@
+class Solution {
+  int removeElement(List<int> nums, int val) {
+    var index = 0;
+    for (int i = 0; i < nums.length; i++) {
+      if (nums[i] != val) {
+        nums[index++] = nums[i];
+      }
+    }
+    return index;
+  }
+}

test/easy/remove_element_test.dart

@@ -0,0 +1,13 @@
+import 'package:leetcode_dart/easy/remove_element.dart';
+import 'package:test/test.dart';
+
+void main() {
+  group(
+    'Example tests',
+    () {
+      final re = Solution();
+      test('2', () => expect(2, re.removeElement([3, 2, 2, 3], 3)));
+      test('5', () => expect(5, re.removeElement([0, 1, 2, 2, 3, 0, 4, 2], 2)));
+    },
+  );
+}