package leetcode;

/**
 * https://leetcode.com/problems/previous-permutation-with-one-swap/
 */
public class Problem1053 {
    public int[] prevPermOpt1(int[] A) {
        // TODO
        return null;
    }

    public static void main(String[] args) {
        Problem1053 prob = new Problem1053();
    }
}

@@ -12,16 +12,42 @@
 tcode;%0A%0A
+import java.util.Arrays;%0A%0A
 /**%0A * h
@@ -318,16 +318,411 @@
 1053();%0A
+        System.out.println(Arrays.toString(prob.prevPermOpt1(new int%5B%5D%7B3, 2, 1%7D))); // %5B3,1,2%5D%0A        System.out.println(Arrays.toString(prob.prevPermOpt1(new int%5B%5D%7B1, 1, 5%7D))); // %5B1,1,5%5D%0A        System.out.println(Arrays.toString(prob.prevPermOpt1(new int%5B%5D%7B1, 9, 4, 6, 7%7D))); // %5B1,7,4,6,9%5D%0A        System.out.println(Arrays.toString(prob.prevPermOpt1(new int%5B%5D%7B3, 1, 1, 3%7D))); // %5B1,3,1,3%5D%0A
     %7D%0A%7D%0A

Update problem 1053