feat: add java solution to lc problem: No.1289.Minimum Falling Path Sum Ⅱ (doocs#536)

Author: hongyiheng

solution/1200-1299/1289.Minimum Falling Path Sum II/README.md

@@ -54,7 +54,28 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public void rotate(int[] nums, int k) {
+        int[] res = new int[nums.length];
+        int leftInit = 0;
+        if (nums.length < k) {
+            k = k % nums.length;
+        }
+        for (int i = nums.length - k; i < nums.length; i++) {
+            res[leftInit] = nums[i];
+            leftInit++;
+        }
+        int rightInit = 0;
+        for (int i = k; i < nums.length; i++) {
+            res[i] = nums[rightInit];
+            rightInit++;
+        }
+        for (int i = 0; i < nums.length; i++) {
+            nums[i] = res[i];
+        }
+
+    }
+}
 ```
 
 ### **...**

solution/1200-1299/1289.Minimum Falling Path Sum II/README_EN.md

@@ -44,7 +44,28 @@ The falling path with the smallest sum is [1,5,7], so the answer is 13
 ### **Java**
 
 ```java
-
+class Solution {
+    public void rotate(int[] nums, int k) {
+        int[] res = new int[nums.length];
+        int leftInit = 0;
+        if (nums.length < k) {
+            k = k % nums.length;
+        }
+        for (int i = nums.length - k; i < nums.length; i++) {
+            res[leftInit] = nums[i];
+            leftInit++;
+        }
+        int rightInit = 0;
+        for (int i = k; i < nums.length; i++) {
+            res[i] = nums[rightInit];
+            rightInit++;
+        }
+        for (int i = 0; i < nums.length; i++) {
+            nums[i] = res[i];
+        }
+
+    }
+}
 ```
 
 ### **...**

solution/1200-1299/1289.Minimum Falling Path Sum II/Solution.java

@@ -0,0 +1,22 @@
+class Solution {
+    public void rotate(int[] nums, int k) {
+        int[] res = new int[nums.length];
+        int leftInit = 0;
+        if (nums.length < k) {
+            k = k % nums.length;
+        }
+        for (int i = nums.length - k; i < nums.length; i++) {
+            res[leftInit] = nums[i];
+            leftInit++;
+        }
+        int rightInit = 0;
+        for (int i = k; i < nums.length; i++) {
+            res[i] = nums[rightInit];
+            rightInit++;
+        }
+        for (int i = 0; i < nums.length; i++) {
+            nums[i] = res[i];
+        }
+
+    }
+}