1
class Solution {
2
  public int[] prevPermOpt1(int[] arr) {
3
    int n = arr.length;
4
    int small = arr[n - 1];
5
    int prev = arr[n - 1];
6
    for (int i = n - 2; i >= 0; i--) {
7
      if (arr[i] <= prev) {
8
        prev = arr[i];
9
      } else {
10
        int indte = i;
11
        int te = 0;
12
        for (int j = i + 1; j < n; j++) {
13
          if (arr[j] < arr[i] && arr[j] > te) {
14
            te = arr[j];
15
            indte = j;
16
          }
17
        }
18
        int tem = arr[indte];
19
        arr[indte] = arr[i];
20
        arr[i] = tem;
21
        return arr;
22
      }
23
    }
24
    return arr;
25
  }
26
}