add 1313

fishercoder1534 · fishercoder1534 · commit 4b3e0ad2623f · 2020-01-30T19:39:25.000-08:00
diff --git a/README.md b/README.md
@@ -12,6 +12,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | |Easy||
 |1329|[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) | |Medium||
 |1317|[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1317.java) | |Easy||
+|1313|[Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1313.java) | |Easy|Array|
 |1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) | |Medium||
 |1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) | |Easy||
 |1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) | |Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_1313.java b/src/main/java/com/fishercoder/solutions/_1313.java
@@ -0,0 +1,41 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * 1313. Decompress Run-Length Encoded List
+ *
+ * We are given a list nums of integers representing a list compressed with run-length encoding.
+ * Consider each adjacent pair of elements [a, b] = [nums[2*i], nums[2*i+1]] (with i >= 0).
+ * For each such pair, there are a elements with value b in the decompressed list.
+ *
+ * Return the decompressed list.
+ *
+ * Example 1:
+ * Input: nums = [1,2,3,4]
+ * Output: [2,4,4,4]
+ * Explanation: The first pair [1,2] means we have freq = 1 and val = 2 so we generate the array [2].
+ * The second pair [3,4] means we have freq = 3 and val = 4 so we generate [4,4,4].
+ * At the end the concatenation [2] + [4,4,4,4] is [2,4,4,4].
+ *
+ * Constraints:
+ * 2 <= nums.length <= 100
+ * nums.length % 2 == 0
+ * 1 <= nums[i] <= 100
+ * */
+public class _1313 {
+    public static class Solution1 {
+        public int[] decompressRLElist(int[] nums) {
+            List<Integer> list = new ArrayList<>();
+            for (int i = 0; i < nums.length - 1; i += 2) {
+                int count = nums[i];
+                int value = nums[i + 1];
+                while (count-- > 0) {
+                    list.add(value);
+                }
+            }
+            return list.stream().mapToInt(integer -> integer).toArray();
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1313Test.java b/src/test/java/com/fishercoder/_1313Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1313;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1313Test {
+    private static _1313.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1313.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{2, 4, 4, 4}, solution1.decompressRLElist(new int[]{1, 2, 3, 4}));
+    }
+
+}
