Merge pull request #204

add new problem 2.06

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/Execute.kt

@@ -1,7 +1,7 @@
 package com.github.contest
 
 
-import com.github.contest.design.wrapper
+import com.github.contest.design.RLEIterator
 import com.github.contest.math.numberOfPowerfulInt
 import com.github.contest.slidingWindow.customStructure.rabinKarpMultiPattern
 import com.github.contest.slidingWindow.customStructure.slidingWindowClassic
@@ -16,7 +16,14 @@ import java.util.TreeMap
 
 fun main() {
 
-    wrapper()
+    val rleIterator = RLEIterator(intArrayOf(5, 2, 1, 22))
+    rleIterator.next(5).also { println(it) }
+    rleIterator.next(2).also { println(it) }
+    rleIterator.next(1).also { println(it) }
+}
+
+infix fun Int.myRange(to: Int): IntRange {
+    return this..to
 }
 
 

contest/src/main/java/com/github/contest/design/DesignLeetcode.kt

@@ -290,4 +290,45 @@ class NestedIterator(nestedList: List<NestedInteger>) {
     fun next(): Int = store.removeFirst()
 
     fun hasNext(): Boolean = store.isNotEmpty()
+}
+
+/**
+ * 900. RLE Iterator
+ */
+
+class RLEIterator(private val encoding: IntArray) {
+
+    private var count = 0L
+
+    init {
+        for (i in encoding.indices step 2) count += encoding[i].toLong()
+    }
+
+    fun next(n: Int): Int {
+        if (n > count) {
+            count = -1
+            return -1
+        }
+
+        var n = n
+        for (i in encoding.indices step 2) {
+
+            when {
+                n <= encoding[i] -> {
+                    encoding[i] -= n
+                    count -= n
+                    return encoding[i + 1]
+                }
+
+                else -> {
+                    n -= encoding[i]
+                    count -= encoding[i]
+                    encoding[i] = 0
+                }
+            }
+        }
+
+        return 0
+    }
+
 }