add 1588

fishercoder1534 · fishercoder1534 · commit 6201e0d44813 · 2020-09-20T13:37:40.000-07:00
diff --git a/README.md b/README.md
@@ -9,6 +9,7 @@ _If you like this project, please leave me a star._ &#9733;
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
 |1592|[Rearrange Spaces Between Words](https://leetcode.com/problems/rearrange-spaces-between-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1592.java) ||String|Easy|
+|1588|[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1588.java) ||Array|Easy|
 |1583|[Count Unhappy Friends](https://leetcode.com/problems/count-unhappy-friends/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1583.java) ||Array|Medium|
 |1582|[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1582.java) ||Array|Easy|
 |1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java) |[:tv:](https://youtu.be/SJBDLYqrIsM)|String|Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_1588.java b/src/main/java/com/fishercoder/solutions/_1588.java
@@ -0,0 +1,22 @@
+package com.fishercoder.solutions;
+
+public class _1588 {
+    public static class Solution1 {
+        public int sumOddLengthSubarrays(int[] arr) {
+            int sum = 0;
+            for (int i = 0; i < arr.length; i++) {
+                sum += arr[i];
+            }
+            int length = 3;
+            while (length <= arr.length) {
+                for (int j = 0; j <= arr.length - length; j++) {
+                    for (int i = j; i < j + length; i++) {
+                        sum += arr[i];
+                    }
+                }
+                length += 2;
+            }
+            return sum;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1588Test.java b/src/test/java/com/fishercoder/_1588Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1588;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1588Test {
+    private static _1588.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1588.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(58, solution1.sumOddLengthSubarrays(new int[]{1, 4, 2, 5, 3}));
+    }
+
+}
