refactor 1313

fishercoder1534 · fishercoder1534 · commit 94ba1ebb028a · 2020-09-17T06:39:53.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1313.java b/src/main/java/com/fishercoder/solutions/_1313.java
@@ -3,27 +3,6 @@
 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) {
