solves decompressrun length encoded list

Author: anishLearnsToCode

README.md

@@ -337,7 +337,7 @@
 | 1299 | [Replace Elements With Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side)           | [![Java](assets/java.png)](src/ReplaceElementWithGreatestElementOnRightSide.java) [![Python](assets/python.png)](python/replace_element_with_greatest_element_on_right_hand_side.py) |                                                                                                                                   |
 | 1304 | [Find N Unique Integers Sum Up To Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero)                                         |                                                         [![Java](assets/java.png)](src/FindNUniqueIntegersSumUpToZero.java)                                                          |                                                                                                                                   |
 | 1309 | [Decrypt String From Alphabet To Integer Mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping)                     |                                                    [![Java](assets/java.png)](src/DecryptStringFromAlphabetToIntegerMapping.java)                                                    |                                                                                                                                   |
-| 1313 | [Decompress Run-Length Encoded Strings](https://leetcode.com/problems/decompress-run-length-encoded-list)                                            |                                                                                                                                                                                      |                                                                                                                                   |
+| 1313 | [Decompress Run-Length Encoded Strings](https://leetcode.com/problems/decompress-run-length-encoded-list)                                            |                                                           [![Java](assets/java.png)](src/DecompressRunLengthEncodedList.java)                                                            |                                                                                                                                   |
 | 1317 | [Convert Integer to Sum Of Two Non-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers)                  |                                                                                                                                                                                      |                                                                                                                                   |
 | 1323 | [Maximum 69 Number](https://leetcode.com/problems/maximum-69-number)                                                                                 |                                                                                                                                                                                      |                                                                                                                                   |
 | 1331 | [Rank Transform of An Array](https://leetcode.com/problems/rank-transform-of-an-array)                                                               |                                                                                                                                                                                      |                                                                                                                                   |

src/DecompressRunLengthEncodedList.java

@@ -0,0 +1,20 @@
+public class DecompressRunLengthEncodedList {
+    public int[] decompressRLElist(int[] nums) {
+        final int totalElements = sumOfFrequency(nums);
+        final int[] result = new int[totalElements];
+        for (int i = 1, k = 0; i < nums.length ; i += 2) {
+            for (int j = 0 ; j < nums[i - 1] ; j++) {
+                result[k++] = nums[i];
+            }
+        }
+        return result;
+    }
+
+    private int sumOfFrequency(int[] array) {
+        int sum = 0;
+        for (int i = 0 ; i < array.length ; i += 2) {
+            sum += array[i];
+        }
+        return sum;
+    }
+}