feat: add solutions to lc problem: No.1053

Author: thinkasany

solution/1000-1099/1053.Previous Permutation With One Swap/README.md

@@ -142,6 +142,27 @@ func prevPermOpt1(arr []int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function prevPermOpt1(arr: number[]): number[] {
+    const n = arr.length;
+    for (let i = n - 1; i > 0; --i) {
+        if (arr[i - 1] > arr[i]) {
+            for (let j = n - 1; j > i - 1; --j) {
+                if (arr[j] < arr[i - 1] && arr[j] !== arr[j - 1]) {
+                    const t = arr[i - 1];
+                    arr[i - 1] = arr[j];
+                    arr[j] = t;
+                    return arr;
+                }
+            }
+        }
+    }
+    return arr;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1053.Previous Permutation With One Swap/README_EN.md

@@ -124,6 +124,27 @@ func prevPermOpt1(arr []int) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function prevPermOpt1(arr: number[]): number[] {
+    const n = arr.length;
+    for (let i = n - 1; i > 0; --i) {
+        if (arr[i - 1] > arr[i]) {
+            for (let j = n - 1; j > i - 1; --j) {
+                if (arr[j] < arr[i - 1] && arr[j] !== arr[j - 1]) {
+                    const t = arr[i - 1];
+                    arr[i - 1] = arr[j];
+                    arr[j] = t;
+                    return arr;
+                }
+            }
+        }
+    }
+    return arr;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1053.Previous Permutation With One Swap/Solution.ts

@@ -0,0 +1,16 @@
+function prevPermOpt1(arr: number[]): number[] {
+    const n = arr.length;
+    for (let i = n - 1; i > 0; --i) {
+        if (arr[i - 1] > arr[i]) {
+            for (let j = n - 1; j > i - 1; --j) {
+                if (arr[j] < arr[i - 1] && arr[j] !== arr[j - 1]) {
+                    const t = arr[i - 1];
+                    arr[i - 1] = arr[j];
+                    arr[j] = t;
+                    return arr;
+                }
+            }
+        }
+    }
+    return arr;
+}