add 1296 tests

fishercoder1534 · fishercoder1534 · commit e5162e578410 · 2019-12-22T07:07:42.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java) |  |  | |Medium||
 |1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1295.java) |  |  | |Easy||
 |1290|[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1290.java) |  |  | |Easy||
 |1287|[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1287.java) |  |  | |Easy||
diff --git a/src/test/java/com/fishercoder/_1296Test.java b/src/test/java/com/fishercoder/_1296Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1296;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1296Test {
+    private static _1296.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1296.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.isPossibleDivide(new int[]{1, 2, 3, 3, 4, 4, 5, 6}, 4));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(true, solution1.isPossibleDivide(new int[]{3, 2, 1, 2, 3, 4, 3, 4, 5, 9, 10, 11}, 3));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(true, solution1.isPossibleDivide(new int[]{3, 3, 2, 2, 1, 1}, 3));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(false, solution1.isPossibleDivide(new int[]{1, 2, 3, 4}, 3));
+    }
+
+}
