Merge pull request #183

add new problems 28.04

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/array/ArrayLeetcode.kt

@@ -178,7 +178,34 @@ fun maximumTripletValue(nums: IntArray): Long {
     return res
 }
 
+/**
+ * 189. Rotate Array
+ */
+
+fun rotate(nums: IntArray, k: Int) {
+    if (k % nums.size != 0) {
+        val cache = mutableListOf<Int>()
+        val bound = when {
+            k > nums.size -> {
+                val temp = k % nums.size
+                nums.size - temp
+            }
+
+            else -> nums.size - k
+        }
+        for (i in bound until nums.size) {
+            cache.add(nums[i])
+        }
+
+        for (i in 0 until bound) {
+            cache.add(nums[i])
+        }
 
+        for (i in 0 until cache.size) {
+            nums[i] = cache[i]
+        }
+    }
+}
 
 
 

contest/src/main/java/com/github/contest/dp/DpLeetcode.kt

@@ -597,6 +597,31 @@ fun canJump(nums: IntArray): Boolean {
     return true
 }
 
+/**
+ * 45. Jump Game II
+ */
+
+fun jump(nums: IntArray): Int {
+    var jumps = 0
+    var currentEnd = 0
+    var farthest = 0
+
+    for (i in 0 until nums.size - 1) {
+        farthest = maxOf(farthest, i + nums[i])
+
+        if (i == currentEnd) {
+            jumps++
+            currentEnd = farthest
+
+            if (currentEnd >= nums.size - 1) {
+                break
+            }
+        }
+    }
+
+    return jumps
+}
+