feat: add solutions to lc problem: No.1313. Decompress Run-Length

Encoded List

Author: yanglbme

solution/1300-1399/1313.Decompress Run-Length Encoded List/README.md

@@ -52,15 +52,65 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def decompressRLElist(self, nums: List[int]) -> List[int]:
+        res = []
+        for i in range(1, len(nums), 2):
+            res.extend([nums[i]] * nums[i - 1])
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int[] decompressRLElist(int[] nums) {
+        int n = 0;
+        for (int i = 0; i < nums.length; i += 2) {
+            n += nums[i];
+        }
+        int[] res = new int[n];
+        for (int i = 1, k = 0; i < nums.length; i += 2) {
+            for (int j = 0; j < nums[i - 1]; ++j) {
+                res[k++] = nums[i];
+            }
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> decompressRLElist(vector<int>& nums) {
+        vector<int> res;
+        for (int i = 1; i < nums.size(); i += 2) {
+            for (int j = 0; j < nums[i - 1]; ++j) {
+                res.push_back(nums[i]);
+            }
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func decompressRLElist(nums []int) []int {
+	var res []int
+	for i := 1; i < len(nums); i += 2 {
+		for j := 0; j < nums[i-1]; j++ {
+			res = append(res, nums[i])
+		}
+	}
+	return res
+}
 ```
 
 ### **...**

solution/1300-1399/1313.Decompress Run-Length Encoded List/README_EN.md

@@ -45,13 +45,63 @@ At the end the concatenation [2] + [4,4,4] is [2,4,4,4].
 ### **Python3**
 
 ```python
-
+class Solution:
+    def decompressRLElist(self, nums: List[int]) -> List[int]:
+        res = []
+        for i in range(1, len(nums), 2):
+            res.extend([nums[i]] * nums[i - 1])
+        return res
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int[] decompressRLElist(int[] nums) {
+        int n = 0;
+        for (int i = 0; i < nums.length; i += 2) {
+            n += nums[i];
+        }
+        int[] res = new int[n];
+        for (int i = 1, k = 0; i < nums.length; i += 2) {
+            for (int j = 0; j < nums[i - 1]; ++j) {
+                res[k++] = nums[i];
+            }
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> decompressRLElist(vector<int>& nums) {
+        vector<int> res;
+        for (int i = 1; i < nums.size(); i += 2) {
+            for (int j = 0; j < nums[i - 1]; ++j) {
+                res.push_back(nums[i]);
+            }
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func decompressRLElist(nums []int) []int {
+	var res []int
+	for i := 1; i < len(nums); i += 2 {
+		for j := 0; j < nums[i-1]; j++ {
+			res = append(res, nums[i])
+		}
+	}
+	return res
+}
 ```
 
 ### **...**

solution/1300-1399/1313.Decompress Run-Length Encoded List/Solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    vector<int> decompressRLElist(vector<int>& nums) {
+        vector<int> res;
+        for (int i = 1; i < nums.size(); i += 2) {
+            for (int j = 0; j < nums[i - 1]; ++j) {
+                res.push_back(nums[i]);
+            }
+        }
+        return res;
+    }
+};

solution/1300-1399/1313.Decompress Run-Length Encoded List/Solution.go

@@ -0,0 +1,9 @@
+func decompressRLElist(nums []int) []int {
+	var res []int
+	for i := 1; i < len(nums); i += 2 {
+		for j := 0; j < nums[i-1]; j++ {
+			res = append(res, nums[i])
+		}
+	}
+	return res
+}

solution/1300-1399/1313.Decompress Run-Length Encoded List/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int[] decompressRLElist(int[] nums) {
+        int n = 0;
+        for (int i = 0; i < nums.length; i += 2) {
+            n += nums[i];
+        }
+        int[] res = new int[n];
+        for (int i = 1, k = 0; i < nums.length; i += 2) {
+            for (int j = 0; j < nums[i - 1]; ++j) {
+                res[k++] = nums[i];
+            }
+        }
+        return res;
+    }
+}

solution/1300-1399/1313.Decompress Run-Length Encoded List/Solution.py

@@ -0,0 +1,6 @@
+class Solution:
+    def decompressRLElist(self, nums: List[int]) -> List[int]:
+        res = []
+        for i in range(1, len(nums), 2):
+            res.extend([nums[i]] * nums[i - 1])
+        return res