add more tests for 1524

fishercoder1534 · fishercoder1534 · commit 097ffb325f1e · 2020-07-25T14:05:27.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1524.java b/src/main/java/com/fishercoder/solutions/_1524.java
@@ -22,25 +22,25 @@ public int numOfSubarrays(int[] arr) {
 
     public static class Solution2 {
         public int numOfSubarrays(int[] arr) {
-            int odd = 0;
-            int even = 1;
-            long count = 0;
+            int oddSumCount = 0;
+            int evenSumCount = 1;
+            long result = 0;
             int sum = 0;
             for (int num : arr) {
                 sum += num;
                 if (sum % 2 == 0) {
-                    count += odd;
+                    result += oddSumCount;
                 } else {
-                    count += even;
+                    result += evenSumCount;
                 }
                 if (sum % 2 == 0) {
-                    even++;
+                    evenSumCount++;
                 } else {
-                    odd++;
+                    oddSumCount++;
                 }
-                count %= 1000000007;
+                result %= 1000000007;
             }
-            return (int) count % 1000000007;
+            return (int) result % 1000000007;
         }
     }
 }
diff --git a/src/test/java/com/fishercoder/_1524Test.java b/src/test/java/com/fishercoder/_1524Test.java
@@ -41,4 +41,22 @@ public void test5() {
         assertEquals(0, solution2.numOfSubarrays(arr));
     }
 
+    @Test
+    public void test6() {
+        arr = new int[]{1, 2, 3, 4, 5, 6, 7};
+        assertEquals(16, solution2.numOfSubarrays(arr));
+    }
+
+    @Test
+    public void test7() {
+        arr = new int[]{1, 2, 3, 4, 5};
+        assertEquals(9, solution2.numOfSubarrays(arr));
+    }
+
+    @Test
+    public void test8() {
+        arr = new int[]{1, 2, 3, 4};
+        assertEquals(6, solution2.numOfSubarrays(arr));
+    }
+
 }

Original file line number	Diff line number	Diff line change
`@@ -22,25 +22,25 @@ public int numOfSubarrays(int[] arr) {`
`22`	`22`
`23`	`23`	`public static class Solution2 {`
`24`	`24`	`public int numOfSubarrays(int[] arr) {`
`25`		`- int odd = 0;`
`26`		`- int even = 1;`
`27`		`- long count = 0;`
	`25`	`+ int oddSumCount = 0;`
	`26`	`+ int evenSumCount = 1;`
	`27`	`+ long result = 0;`
`28`	`28`	`int sum = 0;`
`29`	`29`	`for (int num : arr) {`
`30`	`30`	`sum += num;`
`31`	`31`	`if (sum % 2 == 0) {`
`32`		`- count += odd;`
	`32`	`+ result += oddSumCount;`
`33`	`33`	`} else {`
`34`		`- count += even;`
	`34`	`+ result += evenSumCount;`
`35`	`35`	`}`
`36`	`36`	`if (sum % 2 == 0) {`
`37`		`- even++;`
	`37`	`+ evenSumCount++;`
`38`	`38`	`} else {`
`39`		`- odd++;`
	`39`	`+ oddSumCount++;`
`40`	`40`	`}`
`41`		`- count %= 1000000007;`
	`41`	`+ result %= 1000000007;`
`42`	`42`	`}`
`43`		`- return (int) count % 1000000007;`
	`43`	`+ return (int) result % 1000000007;`
`44`	`44`	`}`
`45`	`45`	`}`
`46`	`46`	`}`